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_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:16:02,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:16:02,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:16:02,638 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:16:02,638 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:16:02,639 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:16:02,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:16:02,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:16:02,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:16:02,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:16:02,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:16:02,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:16:02,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:16:02,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:16:02,650 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:16:02,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:16:02,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:16:02,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:16:02,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:16:02,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:16:02,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:16:02,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:16:02,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:16:02,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:16:02,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:16:02,675 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:16:02,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:16:02,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:16:02,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:16:02,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:16:02,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:16:02,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:16:02,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:16:02,680 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:16:02,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:16:02,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:16:02,682 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:16:02,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:16:02,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:16:02,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:16:02,699 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:16:02,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:16:02,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:16:02,700 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:16:02,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:16:02,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:16:02,701 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:16:02,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:16:02,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:16:02,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:16:02,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:16:02,702 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:16:02,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:16:02,702 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:16:02,702 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:16:02,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:16:02,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:16:02,703 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:16:02,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:16:02,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:16:02,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:16:02,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:16:02,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:16:02,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:16:02,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:16:02,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:16:02,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:16:02,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:16:02,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:16:02,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:16:02,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:16:02,769 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:16:02,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 17:16:02,828 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafc5910a/d436bd53e42448ad805efedc5f68f178/FLAG09dc2ea2d [2018-11-14 17:16:03,337 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:16:03,338 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 17:16:03,350 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafc5910a/d436bd53e42448ad805efedc5f68f178/FLAG09dc2ea2d [2018-11-14 17:16:03,364 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafc5910a/d436bd53e42448ad805efedc5f68f178 [2018-11-14 17:16:03,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:16:03,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:16:03,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:16:03,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:16:03,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:16:03,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb4f9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03, skipping insertion in model container [2018-11-14 17:16:03,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:16:03,426 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:16:03,698 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:16:03,705 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:16:03,748 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:16:03,775 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:16:03,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03 WrapperNode [2018-11-14 17:16:03,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:16:03,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:16:03,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:16:03,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:16:03,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (1/1) ... [2018-11-14 17:16:03,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:16:03,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:16:03,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:16:03,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:16:03,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (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 17:16:03,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:16:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:16:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:16:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:16:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:16:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:16:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:16:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:16:05,043 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:16:05,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:16:05 BoogieIcfgContainer [2018-11-14 17:16:05,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:16:05,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:16:05,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:16:05,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:16:05,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:16:03" (1/3) ... [2018-11-14 17:16:05,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4eda90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:16:05, skipping insertion in model container [2018-11-14 17:16:05,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:16:03" (2/3) ... [2018-11-14 17:16:05,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4eda90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:16:05, skipping insertion in model container [2018-11-14 17:16:05,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:16:05" (3/3) ... [2018-11-14 17:16:05,053 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 17:16:05,063 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:16:05,071 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:16:05,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:16:05,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:16:05,119 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:16:05,119 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:16:05,119 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:16:05,119 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:16:05,119 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:16:05,120 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:16:05,120 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:16:05,120 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:16:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-14 17:16:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:16:05,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:16:05,150 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:16:05,152 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:16:05,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:16:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1553022195, now seen corresponding path program 1 times [2018-11-14 17:16:05,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:16:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:16:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:05,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:16:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:16:05,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-14 17:16:05,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-14 17:16:05,479 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #266#return; {60#true} is VALID [2018-11-14 17:16:05,480 INFO L256 TraceCheckUtils]: 3: Hoare triple {60#true} call #t~ret15 := main(); {60#true} is VALID [2018-11-14 17:16:05,480 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2018-11-14 17:16:05,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-14 17:16:05,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {60#true} is VALID [2018-11-14 17:16:05,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {60#true} assume !(~cond~0 == 0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2018-11-14 17:16:05,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#true} assume ~p1~0 != 0;~lk1~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p2~0 != 0;~lk2~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p3~0 != 0;~lk3~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p4~0 != 0;~lk4~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {62#(not (= main_~p1~0 0))} assume !(~p5~0 != 0); {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p6~0 != 0;~lk6~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p7~0 != 0;~lk7~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p8~0 != 0;~lk8~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p9~0 != 0;~lk9~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p10~0 != 0;~lk10~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p11~0 != 0;~lk11~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p12~0 != 0;~lk12~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {62#(not (= main_~p1~0 0))} assume !(~p13~0 != 0); {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {62#(not (= main_~p1~0 0))} assume ~p14~0 != 0;~lk14~0 := 1; {62#(not (= main_~p1~0 0))} is VALID [2018-11-14 17:16:05,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {62#(not (= main_~p1~0 0))} assume !(~p1~0 != 0); {61#false} is VALID [2018-11-14 17:16:05,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {61#false} assume !(~p2~0 != 0); {61#false} is VALID [2018-11-14 17:16:05,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-14 17:16:05,558 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 17:16:05,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:16:05,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:16:05,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:05,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:16:05,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:16:05,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:05,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:16:05,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:16:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:05,685 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2018-11-14 17:16:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:06,679 INFO L93 Difference]: Finished difference Result 158 states and 290 transitions. [2018-11-14 17:16:06,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:16:06,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:16:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2018-11-14 17:16:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2018-11-14 17:16:06,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 290 transitions. [2018-11-14 17:16:07,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:07,286 INFO L225 Difference]: With dead ends: 158 [2018-11-14 17:16:07,287 INFO L226 Difference]: Without dead ends: 98 [2018-11-14 17:16:07,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-14 17:16:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-14 17:16:07,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:16:07,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-14 17:16:07,446 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-14 17:16:07,446 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-14 17:16:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:07,457 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2018-11-14 17:16:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 177 transitions. [2018-11-14 17:16:07,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:07,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:07,460 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-14 17:16:07,460 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-14 17:16:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:07,470 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2018-11-14 17:16:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 177 transitions. [2018-11-14 17:16:07,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:07,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:07,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:16:07,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:16:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 17:16:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 176 transitions. [2018-11-14 17:16:07,485 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 176 transitions. Word has length 25 [2018-11-14 17:16:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:16:07,485 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 176 transitions. [2018-11-14 17:16:07,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:16:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2018-11-14 17:16:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:16:07,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:16:07,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:16:07,490 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:16:07,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:16:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1553015003, now seen corresponding path program 1 times [2018-11-14 17:16:07,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:16:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:16:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:07,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:16:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:16:07,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {535#true} is VALID [2018-11-14 17:16:07,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-14 17:16:07,656 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #266#return; {535#true} is VALID [2018-11-14 17:16:07,656 INFO L256 TraceCheckUtils]: 3: Hoare triple {535#true} call #t~ret15 := main(); {535#true} is VALID [2018-11-14 17:16:07,656 INFO L273 TraceCheckUtils]: 4: Hoare triple {535#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {535#true} is VALID [2018-11-14 17:16:07,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-14 17:16:07,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {535#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {535#true} is VALID [2018-11-14 17:16:07,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {535#true} assume !(~cond~0 == 0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {535#true} is VALID [2018-11-14 17:16:07,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {535#true} assume ~p1~0 != 0;~lk1~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {537#(= main_~lk1~0 1)} assume ~p2~0 != 0;~lk2~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {537#(= main_~lk1~0 1)} assume ~p3~0 != 0;~lk3~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#(= main_~lk1~0 1)} assume ~p4~0 != 0;~lk4~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {537#(= main_~lk1~0 1)} assume !(~p5~0 != 0); {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {537#(= main_~lk1~0 1)} assume ~p6~0 != 0;~lk6~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {537#(= main_~lk1~0 1)} assume ~p7~0 != 0;~lk7~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {537#(= main_~lk1~0 1)} assume ~p8~0 != 0;~lk8~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {537#(= main_~lk1~0 1)} assume ~p9~0 != 0;~lk9~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {537#(= main_~lk1~0 1)} assume ~p10~0 != 0;~lk10~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {537#(= main_~lk1~0 1)} assume ~p11~0 != 0;~lk11~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {537#(= main_~lk1~0 1)} assume ~p12~0 != 0;~lk12~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {537#(= main_~lk1~0 1)} assume !(~p13~0 != 0); {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {537#(= main_~lk1~0 1)} assume ~p14~0 != 0;~lk14~0 := 1; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {537#(= main_~lk1~0 1)} assume ~p1~0 != 0; {537#(= main_~lk1~0 1)} is VALID [2018-11-14 17:16:07,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {537#(= main_~lk1~0 1)} assume ~lk1~0 != 1; {536#false} is VALID [2018-11-14 17:16:07,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {536#false} assume !false; {536#false} is VALID [2018-11-14 17:16:07,692 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 17:16:07,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:16:07,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:16:07,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:07,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:16:07,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:16:07,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:07,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:16:07,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:16:07,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:07,791 INFO L87 Difference]: Start difference. First operand 96 states and 176 transitions. Second operand 3 states. [2018-11-14 17:16:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:07,973 INFO L93 Difference]: Finished difference Result 99 states and 179 transitions. [2018-11-14 17:16:07,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:16:07,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:07,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:16:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-14 17:16:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-14 17:16:07,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2018-11-14 17:16:08,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:08,206 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:16:08,206 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 17:16:08,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 17:16:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-14 17:16:08,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:16:08,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2018-11-14 17:16:08,231 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2018-11-14 17:16:08,231 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2018-11-14 17:16:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:08,237 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2018-11-14 17:16:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2018-11-14 17:16:08,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:08,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:08,239 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2018-11-14 17:16:08,239 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2018-11-14 17:16:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:08,245 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2018-11-14 17:16:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2018-11-14 17:16:08,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:08,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:08,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:16:08,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:16:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-14 17:16:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 177 transitions. [2018-11-14 17:16:08,253 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 177 transitions. Word has length 25 [2018-11-14 17:16:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:16:08,254 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 177 transitions. [2018-11-14 17:16:08,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:16:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2018-11-14 17:16:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:16:08,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:16:08,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:16:08,256 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:16:08,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:16:08,256 INFO L82 PathProgramCache]: Analyzing trace with hash -35325707, now seen corresponding path program 1 times [2018-11-14 17:16:08,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:16:08,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:16:08,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:08,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:16:08,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:16:08,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {945#true} is VALID [2018-11-14 17:16:08,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-14 17:16:08,347 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {945#true} {945#true} #266#return; {945#true} is VALID [2018-11-14 17:16:08,347 INFO L256 TraceCheckUtils]: 3: Hoare triple {945#true} call #t~ret15 := main(); {945#true} is VALID [2018-11-14 17:16:08,348 INFO L273 TraceCheckUtils]: 4: Hoare triple {945#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {945#true} is VALID [2018-11-14 17:16:08,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-14 17:16:08,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {945#true} is VALID [2018-11-14 17:16:08,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {945#true} assume !(~cond~0 == 0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {945#true} is VALID [2018-11-14 17:16:08,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {945#true} assume !(~p1~0 != 0); {945#true} is VALID [2018-11-14 17:16:08,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#true} assume ~p2~0 != 0;~lk2~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p3~0 != 0;~lk3~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p4~0 != 0;~lk4~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {947#(not (= main_~p2~0 0))} assume !(~p5~0 != 0); {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p6~0 != 0;~lk6~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p7~0 != 0;~lk7~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p8~0 != 0;~lk8~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p9~0 != 0;~lk9~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p10~0 != 0;~lk10~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p11~0 != 0;~lk11~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p12~0 != 0;~lk12~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,366 INFO L273 TraceCheckUtils]: 20: Hoare triple {947#(not (= main_~p2~0 0))} assume !(~p13~0 != 0); {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {947#(not (= main_~p2~0 0))} assume ~p14~0 != 0;~lk14~0 := 1; {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {947#(not (= main_~p2~0 0))} assume !(~p1~0 != 0); {947#(not (= main_~p2~0 0))} is VALID [2018-11-14 17:16:08,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {947#(not (= main_~p2~0 0))} assume !(~p2~0 != 0); {946#false} is VALID [2018-11-14 17:16:08,369 INFO L273 TraceCheckUtils]: 24: Hoare triple {946#false} assume !false; {946#false} is VALID [2018-11-14 17:16:08,371 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 17:16:08,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:16:08,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:16:08,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:08,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:16:08,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:16:08,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:08,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:16:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:16:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:08,414 INFO L87 Difference]: Start difference. First operand 97 states and 177 transitions. Second operand 3 states. [2018-11-14 17:16:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:08,603 INFO L93 Difference]: Finished difference Result 227 states and 417 transitions. [2018-11-14 17:16:08,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:16:08,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:16:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-14 17:16:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-14 17:16:08,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2018-11-14 17:16:08,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:08,986 INFO L225 Difference]: With dead ends: 227 [2018-11-14 17:16:08,986 INFO L226 Difference]: Without dead ends: 135 [2018-11-14 17:16:08,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-14 17:16:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-11-14 17:16:09,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:16:09,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 133 states. [2018-11-14 17:16:09,014 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 133 states. [2018-11-14 17:16:09,015 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 133 states. [2018-11-14 17:16:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:09,021 INFO L93 Difference]: Finished difference Result 135 states and 241 transitions. [2018-11-14 17:16:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 241 transitions. [2018-11-14 17:16:09,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:09,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:09,023 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 135 states. [2018-11-14 17:16:09,023 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 135 states. [2018-11-14 17:16:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:09,030 INFO L93 Difference]: Finished difference Result 135 states and 241 transitions. [2018-11-14 17:16:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 241 transitions. [2018-11-14 17:16:09,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:09,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:09,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:16:09,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:16:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-14 17:16:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 240 transitions. [2018-11-14 17:16:09,038 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 240 transitions. Word has length 25 [2018-11-14 17:16:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:16:09,039 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 240 transitions. [2018-11-14 17:16:09,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:16:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 240 transitions. [2018-11-14 17:16:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:16:09,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:16:09,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:16:09,040 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:16:09,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:16:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash -35332899, now seen corresponding path program 1 times [2018-11-14 17:16:09,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:16:09,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:16:09,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:09,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:16:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:16:09,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {1600#true} call ULTIMATE.init(); {1600#true} is VALID [2018-11-14 17:16:09,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {1600#true} assume true; {1600#true} is VALID [2018-11-14 17:16:09,120 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1600#true} {1600#true} #266#return; {1600#true} is VALID [2018-11-14 17:16:09,120 INFO L256 TraceCheckUtils]: 3: Hoare triple {1600#true} call #t~ret15 := main(); {1600#true} is VALID [2018-11-14 17:16:09,120 INFO L273 TraceCheckUtils]: 4: Hoare triple {1600#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {1600#true} is VALID [2018-11-14 17:16:09,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {1600#true} assume true; {1600#true} is VALID [2018-11-14 17:16:09,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {1600#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1600#true} is VALID [2018-11-14 17:16:09,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {1600#true} assume !(~cond~0 == 0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {1600#true} is VALID [2018-11-14 17:16:09,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {1600#true} assume !(~p1~0 != 0); {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#(= main_~p1~0 0)} assume ~p2~0 != 0;~lk2~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#(= main_~p1~0 0)} assume ~p3~0 != 0;~lk3~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#(= main_~p1~0 0)} assume ~p4~0 != 0;~lk4~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {1602#(= main_~p1~0 0)} assume !(~p5~0 != 0); {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {1602#(= main_~p1~0 0)} assume ~p6~0 != 0;~lk6~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {1602#(= main_~p1~0 0)} assume ~p7~0 != 0;~lk7~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {1602#(= main_~p1~0 0)} assume ~p8~0 != 0;~lk8~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {1602#(= main_~p1~0 0)} assume ~p9~0 != 0;~lk9~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {1602#(= main_~p1~0 0)} assume ~p10~0 != 0;~lk10~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {1602#(= main_~p1~0 0)} assume ~p11~0 != 0;~lk11~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {1602#(= main_~p1~0 0)} assume ~p12~0 != 0;~lk12~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {1602#(= main_~p1~0 0)} assume !(~p13~0 != 0); {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {1602#(= main_~p1~0 0)} assume ~p14~0 != 0;~lk14~0 := 1; {1602#(= main_~p1~0 0)} is VALID [2018-11-14 17:16:09,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {1602#(= main_~p1~0 0)} assume ~p1~0 != 0; {1601#false} is VALID [2018-11-14 17:16:09,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {1601#false} assume ~lk1~0 != 1; {1601#false} is VALID [2018-11-14 17:16:09,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {1601#false} assume !false; {1601#false} is VALID [2018-11-14 17:16:09,145 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 17:16:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:16:09,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:16:09,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:09,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:16:09,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:16:09,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:09,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:16:09,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:16:09,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:09,188 INFO L87 Difference]: Start difference. First operand 133 states and 240 transitions. Second operand 3 states. [2018-11-14 17:16:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:09,401 INFO L93 Difference]: Finished difference Result 183 states and 326 transitions. [2018-11-14 17:16:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:16:09,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 17:16:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:16:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2018-11-14 17:16:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:16:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2018-11-14 17:16:09,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 262 transitions. [2018-11-14 17:16:09,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:16:09,747 INFO L225 Difference]: With dead ends: 183 [2018-11-14 17:16:09,747 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 17:16:09,748 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:16:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 17:16:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-14 17:16:09,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:16:09,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-14 17:16:09,805 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-14 17:16:09,805 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-14 17:16:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:09,812 INFO L93 Difference]: Finished difference Result 133 states and 234 transitions. [2018-11-14 17:16:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 234 transitions. [2018-11-14 17:16:09,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:09,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:09,814 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-14 17:16:09,814 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-14 17:16:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:16:09,820 INFO L93 Difference]: Finished difference Result 133 states and 234 transitions. [2018-11-14 17:16:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 234 transitions. [2018-11-14 17:16:09,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:16:09,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:16:09,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:16:09,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:16:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-14 17:16:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 233 transitions. [2018-11-14 17:16:09,827 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 233 transitions. Word has length 25 [2018-11-14 17:16:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:16:09,827 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 233 transitions. [2018-11-14 17:16:09,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:16:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 233 transitions. [2018-11-14 17:16:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:16:09,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:16:09,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:16:09,829 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:16:09,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:16:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1056394061, now seen corresponding path program 1 times [2018-11-14 17:16:09,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:16:09,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:16:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:09,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:16:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:16:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:16:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:16:09,919 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:16:09,985 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:16:09,985 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:16:09,985 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:16:09,985 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:16:09,986 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:16:09,986 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:16:09,986 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:16:09,986 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2018-11-14 17:16:09,986 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2018-11-14 17:16:09,986 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:16:09,986 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-14 17:16:09,987 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-14 17:16:09,987 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2018-11-14 17:16:09,987 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-14 17:16:09,987 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-14 17:16:09,987 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:16:09,987 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2018-11-14 17:16:09,987 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2018-11-14 17:16:09,988 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:16:09,988 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2018-11-14 17:16:09,988 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2018-11-14 17:16:09,988 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-14 17:16:09,988 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-14 17:16:09,988 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2018-11-14 17:16:09,988 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2018-11-14 17:16:09,989 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2018-11-14 17:16:09,989 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2018-11-14 17:16:09,989 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2018-11-14 17:16:09,989 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2018-11-14 17:16:09,989 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2018-11-14 17:16:09,989 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2018-11-14 17:16:09,989 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2018-11-14 17:16:09,990 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2018-11-14 17:16:09,991 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2018-11-14 17:16:09,991 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2018-11-14 17:16:09,991 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2018-11-14 17:16:09,991 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2018-11-14 17:16:09,991 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2018-11-14 17:16:09,991 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2018-11-14 17:16:09,991 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2018-11-14 17:16:09,992 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2018-11-14 17:16:09,992 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2018-11-14 17:16:09,992 WARN L170 areAnnotationChecker]: L144-1 has no Hoare annotation [2018-11-14 17:16:09,992 WARN L170 areAnnotationChecker]: L144-1 has no Hoare annotation [2018-11-14 17:16:09,992 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 17:16:09,992 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 17:16:09,992 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 17:16:09,993 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-14 17:16:09,993 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2018-11-14 17:16:09,993 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2018-11-14 17:16:09,993 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2018-11-14 17:16:09,993 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2018-11-14 17:16:09,993 WARN L170 areAnnotationChecker]: L154-1 has no Hoare annotation [2018-11-14 17:16:09,993 WARN L170 areAnnotationChecker]: L154-1 has no Hoare annotation [2018-11-14 17:16:09,994 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-14 17:16:09,994 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-14 17:16:09,994 WARN L170 areAnnotationChecker]: L159-1 has no Hoare annotation [2018-11-14 17:16:09,994 WARN L170 areAnnotationChecker]: L159-1 has no Hoare annotation [2018-11-14 17:16:09,994 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2018-11-14 17:16:09,994 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2018-11-14 17:16:09,994 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2018-11-14 17:16:09,995 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2018-11-14 17:16:09,996 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2018-11-14 17:16:09,996 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2018-11-14 17:16:09,996 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2018-11-14 17:16:09,996 WARN L170 areAnnotationChecker]: L179-1 has no Hoare annotation [2018-11-14 17:16:09,996 WARN L170 areAnnotationChecker]: L179-1 has no Hoare annotation [2018-11-14 17:16:09,996 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2018-11-14 17:16:09,997 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2018-11-14 17:16:09,997 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2018-11-14 17:16:09,997 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2018-11-14 17:16:09,997 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2018-11-14 17:16:09,997 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2018-11-14 17:16:09,997 WARN L170 areAnnotationChecker]: L189-1 has no Hoare annotation [2018-11-14 17:16:09,997 WARN L170 areAnnotationChecker]: L189-1 has no Hoare annotation [2018-11-14 17:16:09,998 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2018-11-14 17:16:09,998 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2018-11-14 17:16:09,998 WARN L170 areAnnotationChecker]: L194-1 has no Hoare annotation [2018-11-14 17:16:09,998 WARN L170 areAnnotationChecker]: L194-1 has no Hoare annotation [2018-11-14 17:16:09,998 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 17:16:09,998 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 17:16:09,998 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2018-11-14 17:16:09,999 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2018-11-14 17:16:09,999 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2018-11-14 17:16:09,999 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2018-11-14 17:16:09,999 WARN L170 areAnnotationChecker]: L204-1 has no Hoare annotation [2018-11-14 17:16:09,999 WARN L170 areAnnotationChecker]: L204-1 has no Hoare annotation [2018-11-14 17:16:09,999 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-14 17:16:09,999 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-14 17:16:10,000 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:16:10,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:16:10 BoogieIcfgContainer [2018-11-14 17:16:10,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:16:10,004 INFO L168 Benchmark]: Toolchain (without parser) took 6628.62 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -348.9 MB). Peak memory consumption was 366.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:16:10,006 INFO L168 Benchmark]: CDTParser took 0.20 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 17:16:10,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.76 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 17:16:10,008 INFO L168 Benchmark]: Boogie Preprocessor took 49.61 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 17:16:10,008 INFO L168 Benchmark]: RCFGBuilder took 1218.40 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -730.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:16:10,009 INFO L168 Benchmark]: TraceAbstraction took 4957.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 371.3 MB). Peak memory consumption was 371.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:16:10,013 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.20 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. * CACSL2BoogieTranslator took 397.76 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 49.61 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 1218.40 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -730.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4957.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 371.3 MB). Peak memory consumption was 371.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 217]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; VAL [p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L86] COND FALSE !(p1 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L90] COND FALSE !(p2 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L94] COND TRUE p3 != 0 [L95] lk3 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L98] COND TRUE p4 != 0 [L99] lk4 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L102] COND FALSE !(p5 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L106] COND TRUE p6 != 0 [L107] lk6 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L110] COND TRUE p7 != 0 [L111] lk7 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L114] COND TRUE p8 != 0 [L115] lk8 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L118] COND TRUE p9 != 0 [L119] lk9 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L122] COND TRUE p10 != 0 [L123] lk10 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L126] COND TRUE p11 != 0 [L127] lk11 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L130] COND TRUE p12 != 0 [L131] lk12 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L134] COND FALSE !(p13 != 0) VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L138] COND TRUE p14 != 0 [L139] lk14 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=1, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L144] COND FALSE !(p1 != 0) VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=1, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L149] COND FALSE !(p2 != 0) VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=1, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] [L217] __VERIFIER_error() VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=1, lk2=0, lk3=1, lk4=1, lk5=0, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=0, p14=3, p2=0, p3=1, p4=1, p5=0, p6=1, p7=1, p8=1, p9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 1 error locations. UNSAFE Result, 4.8s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 465 SDtfs, 230 SDslu, 305 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...