java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:34:53,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:34:53,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:34:53,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:34:53,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:34:53,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:34:53,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:34:53,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:34:53,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:34:53,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:34:53,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:34:53,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:34:53,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:34:53,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:34:53,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:34:53,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:34:53,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:34:53,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:34:53,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:34:53,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:34:53,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:34:53,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:34:53,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:34:53,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:34:53,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:34:53,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:34:53,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:34:53,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:34:53,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:34:53,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:34:53,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:34:53,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:34:53,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:34:53,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:34:53,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:34:53,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:34:53,247 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:34:53,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:34:53,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:34:53,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:34:53,265 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:34:53,266 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:34:53,266 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:34:53,266 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:34:53,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:34:53,267 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:34:53,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:34:53,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:34:53,267 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:34:53,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:34:53,268 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:34:53,268 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:34:53,268 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:34:53,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:34:53,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:34:53,269 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:34:53,269 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:34:53,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:34:53,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:34:53,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:34:53,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:34:53,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:34:53,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:34:53,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:34:53,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:34:53,271 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:34:53,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:34:53,271 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:34:53,271 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:34:53,271 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:34:53,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:34:53,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:34:53,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:34:53,347 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:34:53,348 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:34:53,349 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 18:34:53,419 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2193b67f8/40286fa35b414ceb87d34b7327178be9/FLAG89ebce7ed [2018-11-14 18:34:53,874 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:34:53,875 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 18:34:53,881 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2193b67f8/40286fa35b414ceb87d34b7327178be9/FLAG89ebce7ed [2018-11-14 18:34:53,896 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2193b67f8/40286fa35b414ceb87d34b7327178be9 [2018-11-14 18:34:53,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:34:53,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:34:53,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:34:53,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:34:53,913 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:34:53,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:34:53" (1/1) ... [2018-11-14 18:34:53,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a969f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:53, skipping insertion in model container [2018-11-14 18:34:53,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:34:53" (1/1) ... [2018-11-14 18:34:53,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:34:53,953 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:34:54,199 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:34:54,205 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:34:54,226 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:34:54,241 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:34:54,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54 WrapperNode [2018-11-14 18:34:54,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:34:54,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:34:54,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:34:54,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:34:54,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... [2018-11-14 18:34:54,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... [2018-11-14 18:34:54,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... [2018-11-14 18:34:54,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... [2018-11-14 18:34:54,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... [2018-11-14 18:34:54,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... [2018-11-14 18:34:54,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... [2018-11-14 18:34:54,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:34:54,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:34:54,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:34:54,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:34:54,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:34:54,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:34:54,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:34:54,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:34:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:34:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:34:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:34:54,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:34:54,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:34:54,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:34:54,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:34:54,850 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:34:54,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:34:54 BoogieIcfgContainer [2018-11-14 18:34:54,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:34:54,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:34:54,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:34:54,856 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:34:54,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:34:53" (1/3) ... [2018-11-14 18:34:54,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f384707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:34:54, skipping insertion in model container [2018-11-14 18:34:54,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:34:54" (2/3) ... [2018-11-14 18:34:54,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f384707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:34:54, skipping insertion in model container [2018-11-14 18:34:54,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:34:54" (3/3) ... [2018-11-14 18:34:54,860 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 18:34:54,871 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:34:54,878 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:34:54,893 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:34:54,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:34:54,927 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:34:54,927 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:34:54,927 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:34:54,928 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:34:54,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:34:54,928 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:34:54,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:34:54,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:34:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-14 18:34:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:34:54,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:34:54,954 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:34:54,957 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:34:54,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:34:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-14 18:34:54,969 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:34:54,969 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:34:54,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:34:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:34:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:34:55,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:34:55,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-14 18:34:55,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {19#true} is VALID [2018-11-14 18:34:55,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-14 18:34:55,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-14 18:34:55,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-14 18:34:55,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {19#true} is VALID [2018-11-14 18:34:55,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!~bvsle32(1bv32, ~main__n~0); {42#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-14 18:34:55,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 18:34:55,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-14 18:34:55,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume ~__VERIFIER_assert__cond~0 == 0bv32; {20#false} is VALID [2018-11-14 18:34:55,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-14 18:34:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:34:55,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:34:55,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:34:55,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:34:55,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 18:34:55,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:34:55,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:34:55,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:55,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:34:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:34:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:34:55,321 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-14 18:34:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:55,828 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 18:34:55,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:34:55,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 18:34:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:34:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:34:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-14 18:34:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:34:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-14 18:34:55,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-14 18:34:55,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:55,947 INFO L225 Difference]: With dead ends: 26 [2018-11-14 18:34:55,947 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 18:34:55,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:34:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 18:34:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 18:34:56,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:34:56,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 18:34:56,009 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 18:34:56,009 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 18:34:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:56,013 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 18:34:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 18:34:56,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:56,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:56,014 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 18:34:56,014 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 18:34:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:56,017 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 18:34:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 18:34:56,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:56,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:56,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:34:56,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:34:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:34:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-14 18:34:56,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-14 18:34:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:34:56,024 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-14 18:34:56,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:34:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 18:34:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:34:56,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:34:56,025 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:34:56,025 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:34:56,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:34:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-14 18:34:56,026 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:34:56,026 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:34:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:34:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:34:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:34:56,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:34:56,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-14 18:34:56,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {132#true} is VALID [2018-11-14 18:34:56,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-14 18:34:56,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-14 18:34:56,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-14 18:34:56,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-14 18:34:56,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {155#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-14 18:34:56,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 18:34:56,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:34:56,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:34:56,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {133#false} is VALID [2018-11-14 18:34:56,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-14 18:34:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:34:56,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:34:58,741 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-14 18:34:58,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-14 18:34:58,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {133#false} is VALID [2018-11-14 18:34:58,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:00,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is UNKNOWN [2018-11-14 18:35:00,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is VALID [2018-11-14 18:35:00,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} is VALID [2018-11-14 18:35:00,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-14 18:35:00,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-14 18:35:00,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-14 18:35:00,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-14 18:35:00,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {132#true} is VALID [2018-11-14 18:35:00,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-14 18:35:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:00,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:35:00,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 18:35:00,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-14 18:35:00,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:00,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:35:01,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:01,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:35:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:35:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:35:01,351 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-11-14 18:35:02,547 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-14 18:35:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:02,697 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 18:35:02,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:35:02,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-14 18:35:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:35:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 18:35:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:35:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 18:35:02,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-14 18:35:02,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:02,778 INFO L225 Difference]: With dead ends: 19 [2018-11-14 18:35:02,779 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 18:35:02,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:35:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 18:35:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 18:35:02,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:02,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 18:35:02,795 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 18:35:02,796 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 18:35:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:02,797 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 18:35:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 18:35:02,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:02,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:02,798 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 18:35:02,799 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 18:35:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:02,800 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 18:35:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 18:35:02,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:02,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:02,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:02,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:35:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 18:35:02,803 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-14 18:35:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:02,803 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 18:35:02,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:35:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 18:35:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:35:02,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:02,804 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:02,805 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:02,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2093848400, now seen corresponding path program 2 times [2018-11-14 18:35:02,806 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:02,806 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:35:02,822 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:35:02,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:35:02,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:35:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:02,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:03,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-14 18:35:03,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {299#true} is VALID [2018-11-14 18:35:03,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-14 18:35:03,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-14 18:35:03,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-14 18:35:03,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-14 18:35:03,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {322#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-14 18:35:03,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 18:35:03,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:35:03,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-14 18:35:03,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-14 18:35:03,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:03,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {300#false} is VALID [2018-11-14 18:35:03,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-14 18:35:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:03,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:35:04,856 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 18:35:07,266 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-14 18:35:09,752 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-14 18:35:09,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-14 18:35:09,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {300#false} is VALID [2018-11-14 18:35:09,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:11,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is UNKNOWN [2018-11-14 18:35:13,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-14 18:35:15,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-14 18:35:15,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is VALID [2018-11-14 18:35:15,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {299#true} is VALID [2018-11-14 18:35:15,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-14 18:35:15,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-14 18:35:15,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-14 18:35:15,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-14 18:35:15,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {299#true} is VALID [2018-11-14 18:35:15,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-14 18:35:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:15,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:35:15,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-14 18:35:15,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-14 18:35:15,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:15,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:35:20,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:20,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:35:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:35:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:35:20,126 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-11-14 18:35:22,508 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-14 18:35:23,493 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-11-14 18:35:24,698 WARN L179 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-11-14 18:35:25,190 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-14 18:35:27,293 WARN L179 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-11-14 18:35:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:27,530 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-14 18:35:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:35:27,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-14 18:35:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:35:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-14 18:35:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:35:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-14 18:35:27,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2018-11-14 18:35:34,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 25 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:34,092 INFO L225 Difference]: With dead ends: 24 [2018-11-14 18:35:34,092 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 18:35:34,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:35:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 18:35:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 18:35:34,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:34,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 18:35:34,114 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 18:35:34,114 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 18:35:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:34,116 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 18:35:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 18:35:34,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:34,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:34,117 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 18:35:34,118 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 18:35:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:34,120 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 18:35:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 18:35:34,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:34,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:34,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:34,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:35:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 18:35:34,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2018-11-14 18:35:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:34,123 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 18:35:34,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:35:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 18:35:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:35:34,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:34,125 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:34,125 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:34,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1859945351, now seen corresponding path program 3 times [2018-11-14 18:35:34,126 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:34,126 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:35:34,144 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:35:34,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 18:35:34,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:35:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:34,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:34,723 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:35:34,724 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.term(WrapperScript.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.notSimplified(BitvectorUtils.java:263) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplify_NonConstantCase(BitvectorUtils.java:259) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplifiedResult(BitvectorUtils.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils.termWithLocalSimplification(BitvectorUtils.java:180) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.neg(SmtUtils.java:560) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.product(AffineRelation.java:350) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.onLeftHandSideOnly(AffineRelation.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:145) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.derSimple(XnfDer.java:118) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.tryToEliminate(XnfDer.java:97) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.applyEliminationTechniques(QuantifierPusher.java:302) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:215) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 18:35:34,729 INFO L168 Benchmark]: Toolchain (without parser) took 40822.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -446.7 MB). Peak memory consumption was 309.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:35:34,730 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:35:34,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:35:34,732 INFO L168 Benchmark]: Boogie Preprocessor took 33.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:35:34,732 INFO L168 Benchmark]: RCFGBuilder took 575.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:35:34,733 INFO L168 Benchmark]: TraceAbstraction took 39875.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 343.3 MB). Peak memory consumption was 343.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:35:34,738 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 575.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39875.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 343.3 MB). Peak memory consumption was 343.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...