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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:42:38,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:42:38,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:42:38,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:42:38,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:42:38,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:42:38,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:42:38,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:42:38,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:42:38,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:42:38,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:42:38,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:42:38,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:42:38,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:42:38,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:42:38,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:42:38,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:42:38,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:42:38,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:42:38,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:42:38,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:42:38,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:42:38,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:42:38,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:42:38,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:42:38,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:42:38,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:42:38,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:42:38,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:42:38,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:42:38,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:42:38,283 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:42:38,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:42:38,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:42:38,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:42:38,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:42:38,289 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-23 12:42:38,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:42:38,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:42:38,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:42:38,316 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:42:38,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:42:38,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:42:38,317 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:42:38,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:42:38,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:42:38,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:42:38,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:42:38,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:42:38,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:42:38,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:42:38,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:42:38,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:42:38,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:42:38,319 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:42:38,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:42:38,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:42:38,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:42:38,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:42:38,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:42:38,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:42:38,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:42:38,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:42:38,321 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:42:38,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:42:38,321 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:42:38,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:42:38,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:42:38,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:42:38,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:42:38,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:42:38,395 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:42:38,396 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:42:38,397 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:38,457 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43dc7b2d/0d86ff5dc2134ed992c77cf50190e0d3/FLAG639961459 [2018-11-23 12:42:38,884 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:42:38,884 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:38,892 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43dc7b2d/0d86ff5dc2134ed992c77cf50190e0d3/FLAG639961459 [2018-11-23 12:42:39,259 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43dc7b2d/0d86ff5dc2134ed992c77cf50190e0d3 [2018-11-23 12:42:39,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:42:39,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:42:39,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:39,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:42:39,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:42:39,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d715748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39, skipping insertion in model container [2018-11-23 12:42:39,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:42:39,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:42:39,586 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:39,596 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:42:39,631 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:39,648 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:42:39,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39 WrapperNode [2018-11-23 12:42:39,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:39,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:39,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:42:39,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:42:39,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:39,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:42:39,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:42:39,674 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:42:39,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (1/1) ... [2018-11-23 12:42:39,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:42:39,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:42:39,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:42:39,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:42:39,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (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-23 12:42:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:42:39,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:42:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:42:39,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:42:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:42:39,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:42:40,406 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:42:40,407 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:42:40,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:40 BoogieIcfgContainer [2018-11-23 12:42:40,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:42:40,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:42:40,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:42:40,411 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:42:40,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:42:39" (1/3) ... [2018-11-23 12:42:40,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccc98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:40, skipping insertion in model container [2018-11-23 12:42:40,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:39" (2/3) ... [2018-11-23 12:42:40,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccc98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:40, skipping insertion in model container [2018-11-23 12:42:40,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:40" (3/3) ... [2018-11-23 12:42:40,416 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:40,424 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:42:40,432 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:42:40,448 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:42:40,478 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:42:40,478 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:42:40,478 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:42:40,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:42:40,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:42:40,479 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:42:40,479 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:42:40,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:42:40,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:42:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:42:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:42:40,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:40,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:40,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:40,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2018-11-23 12:42:40,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:40,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:40,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:40,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:42:40,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:42:40,791 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #112#return; {32#true} is VALID [2018-11-23 12:42:40,791 INFO L256 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-23 12:42:40,792 INFO L273 TraceCheckUtils]: 4: Hoare triple {32#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;havoc ~cond~0; {32#true} is VALID [2018-11-23 12:42:40,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2018-11-23 12:42:40,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {32#true} is VALID [2018-11-23 12:42:40,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} assume 0 != ~p1~0;~lk1~0 := 1; {34#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:40,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {34#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:40,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {34#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:40,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {34#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:40,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {34#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:40,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#(= main_~lk1~0 1)} assume 0 != ~p1~0; {34#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:40,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {33#false} is VALID [2018-11-23 12:42:40,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:42:40,808 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-23 12:42:40,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:40,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:40,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:42:40,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:40,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:41,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:41,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:41,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:41,027 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-23 12:42:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:41,334 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2018-11-23 12:42:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:41,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:42:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:42:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:42:41,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 12:42:41,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:41,670 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:42:41,671 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:42:41,674 INFO L631 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-23 12:42:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:42:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 12:42:41,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:41,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2018-11-23 12:42:41,714 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2018-11-23 12:42:41,715 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2018-11-23 12:42:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:41,722 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2018-11-23 12:42:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2018-11-23 12:42:41,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:41,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:41,724 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2018-11-23 12:42:41,724 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2018-11-23 12:42:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:41,730 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2018-11-23 12:42:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2018-11-23 12:42:41,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:41,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:41,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:41,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:42:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-11-23 12:42:41,737 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2018-11-23 12:42:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:41,738 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-11-23 12:42:41,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-11-23 12:42:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:42:41,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:41,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:41,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:41,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2018-11-23 12:42:41,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:41,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:41,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2018-11-23 12:42:41,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-23 12:42:41,895 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #112#return; {226#true} is VALID [2018-11-23 12:42:41,897 INFO L256 TraceCheckUtils]: 3: Hoare triple {226#true} call #t~ret6 := main(); {226#true} is VALID [2018-11-23 12:42:41,898 INFO L273 TraceCheckUtils]: 4: Hoare triple {226#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;havoc ~cond~0; {226#true} is VALID [2018-11-23 12:42:41,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {226#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {226#true} is VALID [2018-11-23 12:42:41,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {226#true} is VALID [2018-11-23 12:42:41,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#true} assume !(0 != ~p1~0); {228#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:41,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {228#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {228#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:41,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {228#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {228#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:41,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {228#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {228#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:41,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {228#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {228#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:41,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {228#(= main_~p1~0 0)} assume 0 != ~p1~0; {227#false} is VALID [2018-11-23 12:42:41,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {227#false} assume 1 != ~lk1~0; {227#false} is VALID [2018-11-23 12:42:41,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {227#false} assume !false; {227#false} is VALID [2018-11-23 12:42:41,994 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-23 12:42:41,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:41,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:41,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:42:42,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:42,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:42,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:42,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:42,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:42,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:42,194 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2018-11-23 12:42:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,433 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2018-11-23 12:42:42,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:42,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:42:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 12:42:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 12:42:42,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2018-11-23 12:42:42,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:42,640 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:42:42,641 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:42:42,642 INFO L631 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-23 12:42:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:42:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 12:42:42,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:42,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-23 12:42:42,658 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-23 12:42:42,658 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-23 12:42:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,661 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2018-11-23 12:42:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2018-11-23 12:42:42,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:42,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:42,663 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-23 12:42:42,663 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-23 12:42:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,667 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2018-11-23 12:42:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2018-11-23 12:42:42,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:42,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:42,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:42,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:42:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2018-11-23 12:42:42,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2018-11-23 12:42:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:42,672 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2018-11-23 12:42:42,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2018-11-23 12:42:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:42:42,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:42,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:42,673 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:42,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2018-11-23 12:42:42,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:42,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:42,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:42,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {439#true} is VALID [2018-11-23 12:42:42,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {439#true} assume true; {439#true} is VALID [2018-11-23 12:42:42,766 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {439#true} {439#true} #112#return; {439#true} is VALID [2018-11-23 12:42:42,766 INFO L256 TraceCheckUtils]: 3: Hoare triple {439#true} call #t~ret6 := main(); {439#true} is VALID [2018-11-23 12:42:42,767 INFO L273 TraceCheckUtils]: 4: Hoare triple {439#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;havoc ~cond~0; {439#true} is VALID [2018-11-23 12:42:42,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {439#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {439#true} is VALID [2018-11-23 12:42:42,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {439#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {439#true} is VALID [2018-11-23 12:42:42,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {439#true} assume 0 != ~p1~0;~lk1~0 := 1; {441#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:42,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {441#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {441#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:42,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {441#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {441#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:42,771 INFO L273 TraceCheckUtils]: 10: Hoare triple {441#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {441#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:42,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {441#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {441#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:42,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {441#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {440#false} is VALID [2018-11-23 12:42:42,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {440#false} assume 0 != ~p2~0; {440#false} is VALID [2018-11-23 12:42:42,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {440#false} assume 1 != ~lk2~0; {440#false} is VALID [2018-11-23 12:42:42,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {440#false} assume !false; {440#false} is VALID [2018-11-23 12:42:42,777 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-23 12:42:42,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:42,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:42,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:42,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:42,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:42,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:42,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:42,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:42,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:42,812 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2018-11-23 12:42:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,984 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2018-11-23 12:42:42,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:42,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-23 12:42:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-23 12:42:42,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2018-11-23 12:42:43,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:43,244 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:42:43,244 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:42:43,245 INFO L631 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-23 12:42:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:42:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:42:43,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:43,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:42:43,272 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:42:43,272 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:42:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,277 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2018-11-23 12:42:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2018-11-23 12:42:43,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:43,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:43,278 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:42:43,278 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:42:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,282 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2018-11-23 12:42:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2018-11-23 12:42:43,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:43,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:43,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:43,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:42:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2018-11-23 12:42:43,287 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2018-11-23 12:42:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:43,287 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2018-11-23 12:42:43,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2018-11-23 12:42:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:42:43,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:43,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:43,289 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:43,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2018-11-23 12:42:43,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:43,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:43,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:43,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2018-11-23 12:42:43,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 12:42:43,356 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #112#return; {659#true} is VALID [2018-11-23 12:42:43,358 INFO L256 TraceCheckUtils]: 3: Hoare triple {659#true} call #t~ret6 := main(); {659#true} is VALID [2018-11-23 12:42:43,358 INFO L273 TraceCheckUtils]: 4: Hoare triple {659#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;havoc ~cond~0; {659#true} is VALID [2018-11-23 12:42:43,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {659#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {659#true} is VALID [2018-11-23 12:42:43,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {659#true} is VALID [2018-11-23 12:42:43,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {659#true} assume !(0 != ~p1~0); {659#true} is VALID [2018-11-23 12:42:43,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {659#true} assume 0 != ~p2~0;~lk2~0 := 1; {661#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:43,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {661#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {661#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:43,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {661#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {661#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:43,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {661#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {661#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:43,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {661#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {661#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:43,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {661#(= main_~lk2~0 1)} assume 0 != ~p2~0; {661#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:43,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {661#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {660#false} is VALID [2018-11-23 12:42:43,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {660#false} assume !false; {660#false} is VALID [2018-11-23 12:42:43,369 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-23 12:42:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:43,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:43,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:43,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:43,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:43,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:43,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:43,424 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2018-11-23 12:42:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,529 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-11-23 12:42:43,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:43,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:42:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:42:43,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 12:42:43,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:43,650 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:42:43,650 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:42:43,651 INFO L631 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-23 12:42:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:42:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2018-11-23 12:42:43,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:43,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 56 states. [2018-11-23 12:42:43,677 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 56 states. [2018-11-23 12:42:43,677 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 56 states. [2018-11-23 12:42:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,681 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2018-11-23 12:42:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2018-11-23 12:42:43,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:43,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:43,682 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 74 states. [2018-11-23 12:42:43,682 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 74 states. [2018-11-23 12:42:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,687 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2018-11-23 12:42:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2018-11-23 12:42:43,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:43,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:43,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:43,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:42:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2018-11-23 12:42:43,691 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2018-11-23 12:42:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:43,692 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2018-11-23 12:42:43,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2018-11-23 12:42:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:42:43,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:43,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:43,693 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:43,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2018-11-23 12:42:43,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:43,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:43,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {964#true} call ULTIMATE.init(); {964#true} is VALID [2018-11-23 12:42:43,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {964#true} assume true; {964#true} is VALID [2018-11-23 12:42:43,787 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {964#true} {964#true} #112#return; {964#true} is VALID [2018-11-23 12:42:43,787 INFO L256 TraceCheckUtils]: 3: Hoare triple {964#true} call #t~ret6 := main(); {964#true} is VALID [2018-11-23 12:42:43,787 INFO L273 TraceCheckUtils]: 4: Hoare triple {964#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;havoc ~cond~0; {964#true} is VALID [2018-11-23 12:42:43,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {964#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {964#true} is VALID [2018-11-23 12:42:43,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {964#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {964#true} is VALID [2018-11-23 12:42:43,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {964#true} assume !(0 != ~p1~0); {964#true} is VALID [2018-11-23 12:42:43,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {964#true} assume !(0 != ~p2~0); {966#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:43,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {966#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {966#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:43,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {966#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {966#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:43,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {966#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {966#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:43,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {966#(= main_~p2~0 0)} assume !(0 != ~p1~0); {966#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:43,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {966#(= main_~p2~0 0)} assume 0 != ~p2~0; {965#false} is VALID [2018-11-23 12:42:43,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#false} assume 1 != ~lk2~0; {965#false} is VALID [2018-11-23 12:42:43,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {965#false} assume !false; {965#false} is VALID [2018-11-23 12:42:43,793 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-23 12:42:43,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:43,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:43,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:43,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:43,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:43,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:43,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:43,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:43,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:43,817 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2018-11-23 12:42:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,926 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2018-11-23 12:42:43,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:43,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:42:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:42:43,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 12:42:44,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:44,084 INFO L225 Difference]: With dead ends: 124 [2018-11-23 12:42:44,084 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:42:44,085 INFO L631 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-23 12:42:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:42:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-23 12:42:44,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:44,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-23 12:42:44,121 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-23 12:42:44,122 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-23 12:42:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,125 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2018-11-23 12:42:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2018-11-23 12:42:44,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,127 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-23 12:42:44,127 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-23 12:42:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,131 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2018-11-23 12:42:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2018-11-23 12:42:44,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:44,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:42:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2018-11-23 12:42:44,136 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2018-11-23 12:42:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:44,136 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2018-11-23 12:42:44,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2018-11-23 12:42:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:44,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:44,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:44,138 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:44,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2018-11-23 12:42:44,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:44,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:44,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:44,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:44,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2018-11-23 12:42:44,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2018-11-23 12:42:44,206 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #112#return; {1343#true} is VALID [2018-11-23 12:42:44,206 INFO L256 TraceCheckUtils]: 3: Hoare triple {1343#true} call #t~ret6 := main(); {1343#true} is VALID [2018-11-23 12:42:44,207 INFO L273 TraceCheckUtils]: 4: Hoare triple {1343#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;havoc ~cond~0; {1343#true} is VALID [2018-11-23 12:42:44,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {1343#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1343#true} is VALID [2018-11-23 12:42:44,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {1343#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1343#true} is VALID [2018-11-23 12:42:44,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {1343#true} assume !(0 != ~p1~0); {1343#true} is VALID [2018-11-23 12:42:44,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {1343#true} assume 0 != ~p2~0;~lk2~0 := 1; {1345#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:44,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {1345#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1345#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:44,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {1345#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1345#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:44,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {1345#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1345#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:44,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {1345#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {1345#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:44,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {1345#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {1344#false} is VALID [2018-11-23 12:42:44,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {1344#false} assume 0 != ~p3~0; {1344#false} is VALID [2018-11-23 12:42:44,219 INFO L273 TraceCheckUtils]: 15: Hoare triple {1344#false} assume 1 != ~lk3~0; {1344#false} is VALID [2018-11-23 12:42:44,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2018-11-23 12:42:44,221 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-23 12:42:44,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:44,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:44,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:44,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:44,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:44,248 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-23 12:42:44,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:44,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:44,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:44,249 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2018-11-23 12:42:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,617 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2018-11-23 12:42:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:44,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 12:42:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 12:42:44,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-23 12:42:44,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:44,731 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:42:44,731 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:42:44,732 INFO L631 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-23 12:42:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:42:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 12:42:44,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:44,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-23 12:42:44,765 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-23 12:42:44,765 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-23 12:42:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,769 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2018-11-23 12:42:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2018-11-23 12:42:44,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,770 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-23 12:42:44,770 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-23 12:42:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,773 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2018-11-23 12:42:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2018-11-23 12:42:44,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:44,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:42:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2018-11-23 12:42:44,778 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2018-11-23 12:42:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:44,778 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-11-23 12:42:44,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2018-11-23 12:42:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:44,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:44,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:44,780 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:44,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2018-11-23 12:42:44,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:44,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:44,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:44,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:44,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {1715#true} call ULTIMATE.init(); {1715#true} is VALID [2018-11-23 12:42:44,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {1715#true} assume true; {1715#true} is VALID [2018-11-23 12:42:44,840 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1715#true} {1715#true} #112#return; {1715#true} is VALID [2018-11-23 12:42:44,841 INFO L256 TraceCheckUtils]: 3: Hoare triple {1715#true} call #t~ret6 := main(); {1715#true} is VALID [2018-11-23 12:42:44,841 INFO L273 TraceCheckUtils]: 4: Hoare triple {1715#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;havoc ~cond~0; {1715#true} is VALID [2018-11-23 12:42:44,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {1715#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1715#true} is VALID [2018-11-23 12:42:44,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {1715#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1715#true} is VALID [2018-11-23 12:42:44,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {1715#true} assume !(0 != ~p1~0); {1715#true} is VALID [2018-11-23 12:42:44,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {1715#true} assume !(0 != ~p2~0); {1715#true} is VALID [2018-11-23 12:42:44,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {1715#true} assume 0 != ~p3~0;~lk3~0 := 1; {1717#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:44,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {1717#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1717#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:44,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {1717#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1717#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:44,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {1717#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {1717#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:44,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {1717#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {1717#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:44,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {1717#(= main_~lk3~0 1)} assume 0 != ~p3~0; {1717#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:44,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {1717#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {1716#false} is VALID [2018-11-23 12:42:44,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {1716#false} assume !false; {1716#false} is VALID [2018-11-23 12:42:44,854 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-23 12:42:44,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:44,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:44,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:44,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:44,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:44,882 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-23 12:42:44,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:44,883 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2018-11-23 12:42:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,012 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2018-11-23 12:42:45,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:45,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:42:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:42:45,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 12:42:45,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:45,078 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:42:45,078 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:42:45,078 INFO L631 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-23 12:42:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:42:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-11-23 12:42:45,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:45,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 104 states. [2018-11-23 12:42:45,143 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 104 states. [2018-11-23 12:42:45,144 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 104 states. [2018-11-23 12:42:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,148 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2018-11-23 12:42:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2018-11-23 12:42:45,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,150 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 130 states. [2018-11-23 12:42:45,150 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 130 states. [2018-11-23 12:42:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,155 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2018-11-23 12:42:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2018-11-23 12:42:45,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:45,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:42:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2018-11-23 12:42:45,161 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2018-11-23 12:42:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:45,161 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2018-11-23 12:42:45,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2018-11-23 12:42:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:45,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:45,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:45,162 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:45,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2018-11-23 12:42:45,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:45,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:45,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {2242#true} call ULTIMATE.init(); {2242#true} is VALID [2018-11-23 12:42:45,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {2242#true} assume true; {2242#true} is VALID [2018-11-23 12:42:45,242 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2242#true} {2242#true} #112#return; {2242#true} is VALID [2018-11-23 12:42:45,243 INFO L256 TraceCheckUtils]: 3: Hoare triple {2242#true} call #t~ret6 := main(); {2242#true} is VALID [2018-11-23 12:42:45,243 INFO L273 TraceCheckUtils]: 4: Hoare triple {2242#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;havoc ~cond~0; {2242#true} is VALID [2018-11-23 12:42:45,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {2242#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {2242#true} is VALID [2018-11-23 12:42:45,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {2242#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2242#true} is VALID [2018-11-23 12:42:45,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {2242#true} assume !(0 != ~p1~0); {2242#true} is VALID [2018-11-23 12:42:45,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {2242#true} assume !(0 != ~p2~0); {2242#true} is VALID [2018-11-23 12:42:45,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {2242#true} assume !(0 != ~p3~0); {2244#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:45,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {2244#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2244#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:45,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {2244#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2244#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:45,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {2244#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2244#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:45,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {2244#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2244#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:45,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {2244#(= main_~p3~0 0)} assume 0 != ~p3~0; {2243#false} is VALID [2018-11-23 12:42:45,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {2243#false} assume 1 != ~lk3~0; {2243#false} is VALID [2018-11-23 12:42:45,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {2243#false} assume !false; {2243#false} is VALID [2018-11-23 12:42:45,303 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-23 12:42:45,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:45,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:45,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:45,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:45,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:45,320 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-23 12:42:45,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:45,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:45,322 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2018-11-23 12:42:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,470 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2018-11-23 12:42:45,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:45,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-23 12:42:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-23 12:42:45,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2018-11-23 12:42:45,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:45,592 INFO L225 Difference]: With dead ends: 232 [2018-11-23 12:42:45,592 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 12:42:45,593 INFO L631 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-23 12:42:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 12:42:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-23 12:42:45,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:45,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2018-11-23 12:42:45,648 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2018-11-23 12:42:45,649 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2018-11-23 12:42:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,655 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2018-11-23 12:42:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2018-11-23 12:42:45,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,656 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2018-11-23 12:42:45,656 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2018-11-23 12:42:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,660 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2018-11-23 12:42:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2018-11-23 12:42:45,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:45,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:42:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2018-11-23 12:42:45,667 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2018-11-23 12:42:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:45,667 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2018-11-23 12:42:45,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2018-11-23 12:42:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:45,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:45,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:45,669 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:45,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2018-11-23 12:42:45,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:45,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:45,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:45,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:45,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {2925#true} call ULTIMATE.init(); {2925#true} is VALID [2018-11-23 12:42:45,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {2925#true} assume true; {2925#true} is VALID [2018-11-23 12:42:45,899 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2925#true} {2925#true} #112#return; {2925#true} is VALID [2018-11-23 12:42:45,900 INFO L256 TraceCheckUtils]: 3: Hoare triple {2925#true} call #t~ret6 := main(); {2925#true} is VALID [2018-11-23 12:42:45,900 INFO L273 TraceCheckUtils]: 4: Hoare triple {2925#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;havoc ~cond~0; {2925#true} is VALID [2018-11-23 12:42:45,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {2925#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {2925#true} is VALID [2018-11-23 12:42:45,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {2925#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2925#true} is VALID [2018-11-23 12:42:45,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {2925#true} assume !(0 != ~p1~0); {2925#true} is VALID [2018-11-23 12:42:45,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {2925#true} assume !(0 != ~p2~0); {2925#true} is VALID [2018-11-23 12:42:45,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {2925#true} assume 0 != ~p3~0;~lk3~0 := 1; {2927#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,929 INFO L273 TraceCheckUtils]: 10: Hoare triple {2927#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2927#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {2927#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2927#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {2927#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {2927#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {2927#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {2927#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {2927#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {2926#false} is VALID [2018-11-23 12:42:45,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {2926#false} assume 0 != ~p4~0; {2926#false} is VALID [2018-11-23 12:42:45,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {2926#false} assume 1 != ~lk4~0; {2926#false} is VALID [2018-11-23 12:42:45,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {2926#false} assume !false; {2926#false} is VALID [2018-11-23 12:42:45,978 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-23 12:42:45,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:45,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:45,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:45,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:45,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,036 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2018-11-23 12:42:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,166 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2018-11-23 12:42:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:46,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:42:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:42:46,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 12:42:46,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,323 INFO L225 Difference]: With dead ends: 204 [2018-11-23 12:42:46,323 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 12:42:46,324 INFO L631 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-23 12:42:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 12:42:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-23 12:42:46,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:46,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-23 12:42:46,381 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-23 12:42:46,381 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-23 12:42:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,386 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2018-11-23 12:42:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2018-11-23 12:42:46,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,387 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-23 12:42:46,387 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-23 12:42:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,391 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2018-11-23 12:42:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2018-11-23 12:42:46,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:46,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 12:42:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2018-11-23 12:42:46,396 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2018-11-23 12:42:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:46,396 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2018-11-23 12:42:46,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2018-11-23 12:42:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:46,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:46,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:46,398 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:46,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2018-11-23 12:42:46,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:46,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {3592#true} call ULTIMATE.init(); {3592#true} is VALID [2018-11-23 12:42:46,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {3592#true} assume true; {3592#true} is VALID [2018-11-23 12:42:46,623 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3592#true} {3592#true} #112#return; {3592#true} is VALID [2018-11-23 12:42:46,623 INFO L256 TraceCheckUtils]: 3: Hoare triple {3592#true} call #t~ret6 := main(); {3592#true} is VALID [2018-11-23 12:42:46,623 INFO L273 TraceCheckUtils]: 4: Hoare triple {3592#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;havoc ~cond~0; {3592#true} is VALID [2018-11-23 12:42:46,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {3592#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {3592#true} is VALID [2018-11-23 12:42:46,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {3592#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3592#true} is VALID [2018-11-23 12:42:46,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {3592#true} assume !(0 != ~p1~0); {3592#true} is VALID [2018-11-23 12:42:46,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {3592#true} assume !(0 != ~p2~0); {3592#true} is VALID [2018-11-23 12:42:46,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {3592#true} assume !(0 != ~p3~0); {3592#true} is VALID [2018-11-23 12:42:46,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {3592#true} assume 0 != ~p4~0;~lk4~0 := 1; {3594#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {3594#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3594#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {3594#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {3594#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {3594#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {3594#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {3594#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {3594#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {3594#(= main_~lk4~0 1)} assume 0 != ~p4~0; {3594#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {3594#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {3593#false} is VALID [2018-11-23 12:42:46,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {3593#false} assume !false; {3593#false} is VALID [2018-11-23 12:42:46,662 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-23 12:42:46,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:46,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:46,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:46,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:46,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,750 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2018-11-23 12:42:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,956 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2018-11-23 12:42:46,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:46,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:42:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:42:46,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 12:42:47,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,052 INFO L225 Difference]: With dead ends: 236 [2018-11-23 12:42:47,052 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 12:42:47,052 INFO L631 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-23 12:42:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 12:42:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2018-11-23 12:42:47,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:47,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 200 states. [2018-11-23 12:42:47,195 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 200 states. [2018-11-23 12:42:47,195 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 200 states. [2018-11-23 12:42:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,200 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2018-11-23 12:42:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2018-11-23 12:42:47,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,201 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 234 states. [2018-11-23 12:42:47,201 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 234 states. [2018-11-23 12:42:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,206 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2018-11-23 12:42:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2018-11-23 12:42:47,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:47,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 12:42:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2018-11-23 12:42:47,212 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2018-11-23 12:42:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:47,213 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2018-11-23 12:42:47,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2018-11-23 12:42:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:47,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:47,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:47,214 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:47,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2018-11-23 12:42:47,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:47,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {4539#true} call ULTIMATE.init(); {4539#true} is VALID [2018-11-23 12:42:47,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {4539#true} assume true; {4539#true} is VALID [2018-11-23 12:42:47,434 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4539#true} {4539#true} #112#return; {4539#true} is VALID [2018-11-23 12:42:47,434 INFO L256 TraceCheckUtils]: 3: Hoare triple {4539#true} call #t~ret6 := main(); {4539#true} is VALID [2018-11-23 12:42:47,434 INFO L273 TraceCheckUtils]: 4: Hoare triple {4539#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;havoc ~cond~0; {4539#true} is VALID [2018-11-23 12:42:47,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {4539#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {4539#true} is VALID [2018-11-23 12:42:47,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {4539#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4539#true} is VALID [2018-11-23 12:42:47,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {4539#true} assume !(0 != ~p1~0); {4539#true} is VALID [2018-11-23 12:42:47,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {4539#true} assume !(0 != ~p2~0); {4539#true} is VALID [2018-11-23 12:42:47,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {4539#true} assume !(0 != ~p3~0); {4539#true} is VALID [2018-11-23 12:42:47,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {4539#true} assume !(0 != ~p4~0); {4541#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {4541#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4541#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {4541#(= main_~p4~0 0)} assume !(0 != ~p1~0); {4541#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {4541#(= main_~p4~0 0)} assume !(0 != ~p2~0); {4541#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {4541#(= main_~p4~0 0)} assume !(0 != ~p3~0); {4541#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {4541#(= main_~p4~0 0)} assume 0 != ~p4~0; {4540#false} is VALID [2018-11-23 12:42:47,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {4540#false} assume 1 != ~lk4~0; {4540#false} is VALID [2018-11-23 12:42:47,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {4540#false} assume !false; {4540#false} is VALID [2018-11-23 12:42:47,507 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-23 12:42:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:47,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:47,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:47,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:47,733 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2018-11-23 12:42:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,297 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2018-11-23 12:42:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 12:42:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 12:42:48,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-23 12:42:48,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:48,867 INFO L225 Difference]: With dead ends: 444 [2018-11-23 12:42:48,867 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 12:42:48,868 INFO L631 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-23 12:42:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 12:42:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-23 12:42:49,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:49,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2018-11-23 12:42:49,010 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2018-11-23 12:42:49,010 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2018-11-23 12:42:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,018 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2018-11-23 12:42:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2018-11-23 12:42:49,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,019 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2018-11-23 12:42:49,019 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2018-11-23 12:42:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,027 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2018-11-23 12:42:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2018-11-23 12:42:49,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:49,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 12:42:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2018-11-23 12:42:49,037 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2018-11-23 12:42:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:49,037 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2018-11-23 12:42:49,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2018-11-23 12:42:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:49,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:49,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:49,039 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:49,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:49,040 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2018-11-23 12:42:49,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:49,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:49,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:49,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:49,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {5814#true} call ULTIMATE.init(); {5814#true} is VALID [2018-11-23 12:42:49,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {5814#true} assume true; {5814#true} is VALID [2018-11-23 12:42:49,275 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5814#true} {5814#true} #112#return; {5814#true} is VALID [2018-11-23 12:42:49,275 INFO L256 TraceCheckUtils]: 3: Hoare triple {5814#true} call #t~ret6 := main(); {5814#true} is VALID [2018-11-23 12:42:49,276 INFO L273 TraceCheckUtils]: 4: Hoare triple {5814#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;havoc ~cond~0; {5814#true} is VALID [2018-11-23 12:42:49,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {5814#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {5814#true} is VALID [2018-11-23 12:42:49,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {5814#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {5814#true} is VALID [2018-11-23 12:42:49,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {5814#true} assume !(0 != ~p1~0); {5814#true} is VALID [2018-11-23 12:42:49,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {5814#true} assume !(0 != ~p2~0); {5814#true} is VALID [2018-11-23 12:42:49,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {5814#true} assume !(0 != ~p3~0); {5814#true} is VALID [2018-11-23 12:42:49,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {5814#true} assume 0 != ~p4~0;~lk4~0 := 1; {5816#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {5816#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5816#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {5816#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {5816#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {5816#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {5816#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {5816#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {5816#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {5816#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {5815#false} is VALID [2018-11-23 12:42:49,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {5815#false} assume 0 != ~p5~0; {5815#false} is VALID [2018-11-23 12:42:49,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {5815#false} assume 1 != ~lk5~0; {5815#false} is VALID [2018-11-23 12:42:49,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {5815#false} assume !false; {5815#false} is VALID [2018-11-23 12:42:49,352 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-23 12:42:49,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:49,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:49,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:49,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:49,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:49,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:49,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:49,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:49,512 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2018-11-23 12:42:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,004 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2018-11-23 12:42:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:50,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 12:42:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 12:42:50,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 12:42:50,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:50,479 INFO L225 Difference]: With dead ends: 384 [2018-11-23 12:42:50,479 INFO L226 Difference]: Without dead ends: 266 [2018-11-23 12:42:50,480 INFO L631 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-23 12:42:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-23 12:42:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-11-23 12:42:50,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:50,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand 264 states. [2018-11-23 12:42:50,625 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 264 states. [2018-11-23 12:42:50,626 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 264 states. [2018-11-23 12:42:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,634 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2018-11-23 12:42:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2018-11-23 12:42:50,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,635 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 266 states. [2018-11-23 12:42:50,635 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 266 states. [2018-11-23 12:42:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,644 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2018-11-23 12:42:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2018-11-23 12:42:50,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:50,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 12:42:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2018-11-23 12:42:50,654 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2018-11-23 12:42:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:50,654 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2018-11-23 12:42:50,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2018-11-23 12:42:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:50,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:50,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:50,656 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:50,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2018-11-23 12:42:50,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:50,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:50,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {7053#true} call ULTIMATE.init(); {7053#true} is VALID [2018-11-23 12:42:50,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {7053#true} assume true; {7053#true} is VALID [2018-11-23 12:42:50,871 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7053#true} {7053#true} #112#return; {7053#true} is VALID [2018-11-23 12:42:50,871 INFO L256 TraceCheckUtils]: 3: Hoare triple {7053#true} call #t~ret6 := main(); {7053#true} is VALID [2018-11-23 12:42:50,872 INFO L273 TraceCheckUtils]: 4: Hoare triple {7053#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;havoc ~cond~0; {7053#true} is VALID [2018-11-23 12:42:50,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {7053#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {7053#true} is VALID [2018-11-23 12:42:50,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {7053#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {7053#true} is VALID [2018-11-23 12:42:50,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {7053#true} assume !(0 != ~p1~0); {7053#true} is VALID [2018-11-23 12:42:50,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {7053#true} assume !(0 != ~p2~0); {7053#true} is VALID [2018-11-23 12:42:50,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {7053#true} assume !(0 != ~p3~0); {7053#true} is VALID [2018-11-23 12:42:50,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {7053#true} assume !(0 != ~p4~0); {7053#true} is VALID [2018-11-23 12:42:50,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {7053#true} assume 0 != ~p5~0;~lk5~0 := 1; {7055#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {7055#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {7055#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {7055#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {7055#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {7055#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {7055#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {7055#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {7055#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {7055#(= main_~lk5~0 1)} assume 0 != ~p5~0; {7055#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {7055#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {7054#false} is VALID [2018-11-23 12:42:50,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {7054#false} assume !false; {7054#false} is VALID [2018-11-23 12:42:50,963 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-23 12:42:50,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:50,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:50,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:50,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:50,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:51,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:51,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:51,210 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2018-11-23 12:42:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,664 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2018-11-23 12:42:51,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:51,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 12:42:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 12:42:51,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2018-11-23 12:42:52,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:52,158 INFO L225 Difference]: With dead ends: 426 [2018-11-23 12:42:52,158 INFO L226 Difference]: Without dead ends: 424 [2018-11-23 12:42:52,159 INFO L631 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-23 12:42:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-23 12:42:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2018-11-23 12:42:52,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:52,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand 392 states. [2018-11-23 12:42:52,356 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand 392 states. [2018-11-23 12:42:52,356 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 392 states. [2018-11-23 12:42:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,370 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2018-11-23 12:42:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2018-11-23 12:42:52,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:52,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:52,372 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 424 states. [2018-11-23 12:42:52,372 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 424 states. [2018-11-23 12:42:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,384 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2018-11-23 12:42:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2018-11-23 12:42:52,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:52,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:52,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:52,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-23 12:42:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2018-11-23 12:42:52,396 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2018-11-23 12:42:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:52,396 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2018-11-23 12:42:52,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2018-11-23 12:42:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:52,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:52,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:52,398 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:52,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:52,399 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2018-11-23 12:42:52,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:52,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:52,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:52,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:52,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:52,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {8785#true} call ULTIMATE.init(); {8785#true} is VALID [2018-11-23 12:42:52,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {8785#true} assume true; {8785#true} is VALID [2018-11-23 12:42:52,634 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8785#true} {8785#true} #112#return; {8785#true} is VALID [2018-11-23 12:42:52,634 INFO L256 TraceCheckUtils]: 3: Hoare triple {8785#true} call #t~ret6 := main(); {8785#true} is VALID [2018-11-23 12:42:52,634 INFO L273 TraceCheckUtils]: 4: Hoare triple {8785#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;havoc ~cond~0; {8785#true} is VALID [2018-11-23 12:42:52,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {8785#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {8785#true} is VALID [2018-11-23 12:42:52,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {8785#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8785#true} is VALID [2018-11-23 12:42:52,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {8785#true} assume !(0 != ~p1~0); {8785#true} is VALID [2018-11-23 12:42:52,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {8785#true} assume !(0 != ~p2~0); {8785#true} is VALID [2018-11-23 12:42:52,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {8785#true} assume !(0 != ~p3~0); {8785#true} is VALID [2018-11-23 12:42:52,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {8785#true} assume !(0 != ~p4~0); {8785#true} is VALID [2018-11-23 12:42:52,648 INFO L273 TraceCheckUtils]: 11: Hoare triple {8785#true} assume !(0 != ~p5~0); {8787#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {8787#(= main_~p5~0 0)} assume !(0 != ~p1~0); {8787#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {8787#(= main_~p5~0 0)} assume !(0 != ~p2~0); {8787#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {8787#(= main_~p5~0 0)} assume !(0 != ~p3~0); {8787#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {8787#(= main_~p5~0 0)} assume !(0 != ~p4~0); {8787#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {8787#(= main_~p5~0 0)} assume 0 != ~p5~0; {8786#false} is VALID [2018-11-23 12:42:52,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {8786#false} assume 1 != ~lk5~0; {8786#false} is VALID [2018-11-23 12:42:52,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {8786#false} assume !false; {8786#false} is VALID [2018-11-23 12:42:52,657 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-23 12:42:52,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:52,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:52,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:52,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:52,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:52,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:52,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:52,676 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2018-11-23 12:42:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,978 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2018-11-23 12:42:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:52,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 12:42:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 12:42:52,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 12:42:53,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:53,070 INFO L225 Difference]: With dead ends: 856 [2018-11-23 12:42:53,070 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:42:53,072 INFO L631 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-23 12:42:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:42:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:42:53,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:53,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:42:53,072 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:42:53,073 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:42:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,073 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:42:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:42:53,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,073 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:42:53,073 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:42:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,073 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:42:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:42:53,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:53,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:42:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:42:53,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-23 12:42:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:53,075 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:42:53,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:42:53,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:42:53,113 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:42:53,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:42:53,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:42:53,113 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:42:53,113 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:42:53,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:42:53,113 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-23 12:42:53,113 INFO L451 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-23 12:42:53,113 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-23 12:42:53,113 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-23 12:42:53,114 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-23 12:42:53,115 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,115 INFO L451 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-23 12:42:53,115 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-23 12:42:53,115 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-23 12:42:53,115 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,115 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-23 12:42:53,115 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-23 12:42:53,115 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-23 12:42:53,115 INFO L444 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-23 12:42:53,116 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 12:42:53,117 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:42:53,117 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:42:53,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:42:53,117 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 12:42:53,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:42:53,117 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-23 12:42:53,118 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 12:42:53,119 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 12:42:53,120 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-23 12:42:53,121 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-23 12:42:53,121 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 12:42:53,121 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 12:42:53,121 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-23 12:42:53,121 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-23 12:42:53,121 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:42:53,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:42:53 BoogieIcfgContainer [2018-11-23 12:42:53,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:42:53,131 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:42:53,131 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:42:53,131 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:42:53,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:40" (3/4) ... [2018-11-23 12:42:53,136 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:42:53,143 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:42:53,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:42:53,149 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:42:53,150 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:42:53,150 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:42:53,213 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 12:42:53,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:42:53,215 INFO L168 Benchmark]: Toolchain (without parser) took 13945.43 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 855.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -682.4 MB). Peak memory consumption was 173.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:42:53,216 INFO L168 Benchmark]: CDTParser took 0.23 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-23 12:42:53,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.52 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-23 12:42:53,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.83 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-23 12:42:53,218 INFO L168 Benchmark]: Boogie Preprocessor took 29.64 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-23 12:42:53,218 INFO L168 Benchmark]: RCFGBuilder took 704.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:42:53,219 INFO L168 Benchmark]: TraceAbstraction took 12721.90 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 123.2 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 60.4 MB). Peak memory consumption was 183.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:42:53,220 INFO L168 Benchmark]: Witness Printer took 82.54 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:42:53,223 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.23 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 378.52 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 Procedure Inliner took 22.83 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. * Boogie Preprocessor took 29.64 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 704.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12721.90 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 123.2 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 60.4 MB). Peak memory consumption was 183.6 MB. Max. memory is 7.1 GB. * Witness Printer took 82.54 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 12.6s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, 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: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...