java -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.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:38:34,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:38:34,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:38:34,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:38:34,621 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:38:34,622 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:38:34,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:38:34,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:38:34,628 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:38:34,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:38:34,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:38:34,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:38:34,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:38:34,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:38:34,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:38:34,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:38:34,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:38:34,648 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:38:34,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:38:34,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:38:34,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:38:34,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:38:34,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:38:34,662 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:38:34,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:38:34,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:38:34,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:38:34,666 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:38:34,667 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:38:34,668 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:38:34,668 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:38:34,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:38:34,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:38:34,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:38:34,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:38:34,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:38:34,675 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:38:34,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:38:34,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:38:34,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:38:34,701 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:38:34,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:38:34,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:38:34,705 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:38:34,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:38:34,707 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:38:34,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:38:34,707 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:38:34,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:38:34,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:38:34,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:38:34,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:38:34,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:38:34,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:38:34,709 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:38:34,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:38:34,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:38:34,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:38:34,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:38:34,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:38:34,710 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:38:34,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:38:34,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:38:34,710 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:38:34,710 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:38:34,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:38:34,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:38:34,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:38:34,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:38:34,778 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:38:34,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-06 22:38:34,838 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d01875e/b7f36a9a01b14dda94f22dd400a716bb/FLAG6f4d83742 [2018-11-06 22:38:35,243 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:38:35,244 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-06 22:38:35,250 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d01875e/b7f36a9a01b14dda94f22dd400a716bb/FLAG6f4d83742 [2018-11-06 22:38:35,264 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d01875e/b7f36a9a01b14dda94f22dd400a716bb [2018-11-06 22:38:35,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:38:35,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:38:35,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:38:35,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:38:35,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:38:35,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c641d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35, skipping insertion in model container [2018-11-06 22:38:35,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:38:35,319 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:38:35,592 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:38:35,604 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:38:35,642 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:38:35,666 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:38:35,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35 WrapperNode [2018-11-06 22:38:35,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:38:35,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:38:35,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:38:35,668 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:38:35,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:38:35,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:38:35,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:38:35,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:38:35,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (1/1) ... [2018-11-06 22:38:35,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:38:35,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:38:35,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:38:35,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:38:35,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (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-06 22:38:35,931 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-06 22:38:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-06 22:38:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-06 22:38:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-06 22:38:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:38:35,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:38:35,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-06 22:38:36,534 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:38:36,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:36 BoogieIcfgContainer [2018-11-06 22:38:36,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:38:36,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:38:36,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:38:36,539 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:38:36,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:38:35" (1/3) ... [2018-11-06 22:38:36,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42970dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:36, skipping insertion in model container [2018-11-06 22:38:36,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:35" (2/3) ... [2018-11-06 22:38:36,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42970dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:36, skipping insertion in model container [2018-11-06 22:38:36,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:36" (3/3) ... [2018-11-06 22:38:36,543 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-06 22:38:36,552 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:38:36,560 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:38:36,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:38:36,609 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:38:36,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:38:36,610 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:38:36,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:38:36,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:38:36,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:38:36,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:38:36,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:38:36,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:38:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-06 22:38:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-06 22:38:36,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:36,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:36,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:36,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 766881521, now seen corresponding path program 1 times [2018-11-06 22:38:36,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:36,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:36,792 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-06 22:38:36,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:36,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:38:36,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:38:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:38:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:38:36,817 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-11-06 22:38:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:36,839 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2018-11-06 22:38:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:38:36,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-06 22:38:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:36,852 INFO L225 Difference]: With dead ends: 113 [2018-11-06 22:38:36,852 INFO L226 Difference]: Without dead ends: 48 [2018-11-06 22:38:36,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:38:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-06 22:38:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-06 22:38:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-06 22:38:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-06 22:38:36,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 24 [2018-11-06 22:38:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:36,895 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-06 22:38:36,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:38:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-06 22:38:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-06 22:38:36,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:36,897 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:36,898 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:36,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:36,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1859262095, now seen corresponding path program 1 times [2018-11-06 22:38:36,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:36,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:36,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:36,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:36,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:36,998 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-06 22:38:36,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:36,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:38:37,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:38:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:38:37,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:38:37,001 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 3 states. [2018-11-06 22:38:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:37,084 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-11-06 22:38:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:38:37,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-06 22:38:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:37,086 INFO L225 Difference]: With dead ends: 90 [2018-11-06 22:38:37,086 INFO L226 Difference]: Without dead ends: 49 [2018-11-06 22:38:37,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:38:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-06 22:38:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-06 22:38:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-06 22:38:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-11-06 22:38:37,096 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2018-11-06 22:38:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:37,097 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-06 22:38:37,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:38:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-06 22:38:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-06 22:38:37,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:37,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:37,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:37,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1079902444, now seen corresponding path program 1 times [2018-11-06 22:38:37,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:37,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:37,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:37,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:37,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:37,184 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-06 22:38:37,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:37,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:38:37,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:38:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:38:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:38:37,186 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 3 states. [2018-11-06 22:38:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:37,242 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2018-11-06 22:38:37,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:38:37,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-06 22:38:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:37,244 INFO L225 Difference]: With dead ends: 92 [2018-11-06 22:38:37,244 INFO L226 Difference]: Without dead ends: 50 [2018-11-06 22:38:37,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:38:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-06 22:38:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-06 22:38:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-06 22:38:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-06 22:38:37,251 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 33 [2018-11-06 22:38:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:37,252 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-06 22:38:37,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:38:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-06 22:38:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-06 22:38:37,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:37,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:37,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:37,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1022644142, now seen corresponding path program 1 times [2018-11-06 22:38:37,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:37,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:37,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:37,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:37,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:37,442 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-06 22:38:37,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:37,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:38:37,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:38:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:38:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:38:37,445 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 6 states. [2018-11-06 22:38:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:37,905 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-11-06 22:38:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:38:37,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-06 22:38:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:37,908 INFO L225 Difference]: With dead ends: 169 [2018-11-06 22:38:37,908 INFO L226 Difference]: Without dead ends: 97 [2018-11-06 22:38:37,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:38:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-06 22:38:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2018-11-06 22:38:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-06 22:38:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2018-11-06 22:38:37,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 33 [2018-11-06 22:38:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:37,919 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-11-06 22:38:37,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:38:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-06 22:38:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-06 22:38:37,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:37,921 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:37,922 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:37,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2033761392, now seen corresponding path program 1 times [2018-11-06 22:38:37,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:37,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:37,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:38,043 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-06 22:38:38,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:38,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:38:38,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:38:38,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:38:38,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:38:38,045 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 5 states. [2018-11-06 22:38:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:38,529 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2018-11-06 22:38:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:38:38,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-06 22:38:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:38,533 INFO L225 Difference]: With dead ends: 146 [2018-11-06 22:38:38,533 INFO L226 Difference]: Without dead ends: 76 [2018-11-06 22:38:38,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:38:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-06 22:38:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-11-06 22:38:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-06 22:38:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-06 22:38:38,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 33 [2018-11-06 22:38:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:38,549 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-06 22:38:38,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:38:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-06 22:38:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-06 22:38:38,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:38,552 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:38,553 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:38,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2042132773, now seen corresponding path program 1 times [2018-11-06 22:38:38,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:38,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:38,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:38,944 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 22:38:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:38:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 22:38:38,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:38:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:38:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:38:38,987 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2018-11-06 22:38:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:39,450 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2018-11-06 22:38:39,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:38:39,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-06 22:38:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:39,453 INFO L225 Difference]: With dead ends: 193 [2018-11-06 22:38:39,453 INFO L226 Difference]: Without dead ends: 133 [2018-11-06 22:38:39,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:38:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-06 22:38:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 91. [2018-11-06 22:38:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-06 22:38:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2018-11-06 22:38:39,477 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 40 [2018-11-06 22:38:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:39,478 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2018-11-06 22:38:39,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:38:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2018-11-06 22:38:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-06 22:38:39,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:39,481 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:39,484 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:39,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1241717273, now seen corresponding path program 1 times [2018-11-06 22:38:39,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:39,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:39,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:39,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:39,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:38:39,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:38:39,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:38:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:38:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:38:39,743 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 6 states. [2018-11-06 22:38:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:40,014 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2018-11-06 22:38:40,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:38:40,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-06 22:38:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:40,016 INFO L225 Difference]: With dead ends: 180 [2018-11-06 22:38:40,016 INFO L226 Difference]: Without dead ends: 178 [2018-11-06 22:38:40,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:38:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-06 22:38:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 122. [2018-11-06 22:38:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-06 22:38:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2018-11-06 22:38:40,027 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 40 [2018-11-06 22:38:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:40,028 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2018-11-06 22:38:40,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:38:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2018-11-06 22:38:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-06 22:38:40,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:40,030 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:40,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:40,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -448321887, now seen corresponding path program 1 times [2018-11-06 22:38:40,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:40,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:38:40,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:40,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:38:40,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:38:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:38:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:38:40,086 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand 4 states. [2018-11-06 22:38:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:40,189 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2018-11-06 22:38:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:38:40,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-06 22:38:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:40,191 INFO L225 Difference]: With dead ends: 183 [2018-11-06 22:38:40,191 INFO L226 Difference]: Without dead ends: 130 [2018-11-06 22:38:40,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:38:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-06 22:38:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-06 22:38:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-06 22:38:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2018-11-06 22:38:40,207 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 44 [2018-11-06 22:38:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:40,208 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2018-11-06 22:38:40,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:38:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2018-11-06 22:38:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-06 22:38:40,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:40,213 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:40,213 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:40,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1944371172, now seen corresponding path program 1 times [2018-11-06 22:38:40,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:40,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:40,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:38:40,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:38:40,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:38:40,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:38:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:38:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:38:40,280 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand 5 states. [2018-11-06 22:38:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:40,380 INFO L93 Difference]: Finished difference Result 223 states and 268 transitions. [2018-11-06 22:38:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:38:40,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-06 22:38:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:40,382 INFO L225 Difference]: With dead ends: 223 [2018-11-06 22:38:40,382 INFO L226 Difference]: Without dead ends: 173 [2018-11-06 22:38:40,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:38:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-06 22:38:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2018-11-06 22:38:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-06 22:38:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 164 transitions. [2018-11-06 22:38:40,390 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 164 transitions. Word has length 46 [2018-11-06 22:38:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:40,391 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 164 transitions. [2018-11-06 22:38:40,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:38:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2018-11-06 22:38:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-06 22:38:40,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:40,393 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:40,393 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:40,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1898099261, now seen corresponding path program 1 times [2018-11-06 22:38:40,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:40,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:40,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:40,565 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:40,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:40,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:40,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:40,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-06 22:38:40,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:38:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:38:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:38:40,698 INFO L87 Difference]: Start difference. First operand 136 states and 164 transitions. Second operand 8 states. [2018-11-06 22:38:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:41,246 INFO L93 Difference]: Finished difference Result 293 states and 354 transitions. [2018-11-06 22:38:41,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:38:41,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-06 22:38:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:41,249 INFO L225 Difference]: With dead ends: 293 [2018-11-06 22:38:41,249 INFO L226 Difference]: Without dead ends: 182 [2018-11-06 22:38:41,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:38:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-06 22:38:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2018-11-06 22:38:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-06 22:38:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2018-11-06 22:38:41,258 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 48 [2018-11-06 22:38:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:41,258 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2018-11-06 22:38:41,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:38:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2018-11-06 22:38:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-06 22:38:41,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:41,260 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:41,260 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:41,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash 885683226, now seen corresponding path program 2 times [2018-11-06 22:38:41,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:41,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:41,788 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:41,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:38:41,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:38:41,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:41,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:42,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:42,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-06 22:38:42,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 22:38:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 22:38:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-06 22:38:42,034 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand 16 states. [2018-11-06 22:38:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:42,820 INFO L93 Difference]: Finished difference Result 326 states and 380 transitions. [2018-11-06 22:38:42,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 22:38:42,821 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-11-06 22:38:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:42,824 INFO L225 Difference]: With dead ends: 326 [2018-11-06 22:38:42,824 INFO L226 Difference]: Without dead ends: 254 [2018-11-06 22:38:42,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-11-06 22:38:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-06 22:38:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 188. [2018-11-06 22:38:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-06 22:38:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-11-06 22:38:42,839 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 55 [2018-11-06 22:38:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:42,840 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-11-06 22:38:42,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 22:38:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-11-06 22:38:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-06 22:38:42,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:42,842 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:42,842 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:42,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash 942941528, now seen corresponding path program 1 times [2018-11-06 22:38:42,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:42,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:42,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:42,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:42,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:43,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:43,019 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:43,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:43,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-06 22:38:43,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-06 22:38:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-06 22:38:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:38:43,326 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 15 states. [2018-11-06 22:38:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:43,985 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2018-11-06 22:38:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 22:38:43,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-06 22:38:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:43,988 INFO L225 Difference]: With dead ends: 299 [2018-11-06 22:38:43,988 INFO L226 Difference]: Without dead ends: 297 [2018-11-06 22:38:43,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-11-06 22:38:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-06 22:38:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 186. [2018-11-06 22:38:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-06 22:38:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2018-11-06 22:38:43,998 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 55 [2018-11-06 22:38:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:43,999 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2018-11-06 22:38:43,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-06 22:38:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2018-11-06 22:38:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-06 22:38:44,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:44,001 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:44,001 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:44,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1104537944, now seen corresponding path program 1 times [2018-11-06 22:38:44,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:44,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:44,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:44,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:44,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:44,206 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:44,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:44,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:44,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:44,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-06 22:38:44,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-06 22:38:44,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-06 22:38:44,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:38:44,573 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 15 states. [2018-11-06 22:38:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:45,240 INFO L93 Difference]: Finished difference Result 327 states and 380 transitions. [2018-11-06 22:38:45,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 22:38:45,241 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-06 22:38:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:45,243 INFO L225 Difference]: With dead ends: 327 [2018-11-06 22:38:45,243 INFO L226 Difference]: Without dead ends: 325 [2018-11-06 22:38:45,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2018-11-06 22:38:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-06 22:38:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 216. [2018-11-06 22:38:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-06 22:38:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2018-11-06 22:38:45,252 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 255 transitions. Word has length 55 [2018-11-06 22:38:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:45,253 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 255 transitions. [2018-11-06 22:38:45,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-06 22:38:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions. [2018-11-06 22:38:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-06 22:38:45,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:45,256 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:45,257 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:45,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1161796246, now seen corresponding path program 1 times [2018-11-06 22:38:45,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:45,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:45,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:45,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:38:45,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:38:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:38:45,311 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-06 22:38:45,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:38:45 BoogieIcfgContainer [2018-11-06 22:38:45,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:38:45,364 INFO L168 Benchmark]: Toolchain (without parser) took 10091.23 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -910.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:38:45,365 INFO L168 Benchmark]: CDTParser took 0.22 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-06 22:38:45,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.70 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-06 22:38:45,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.62 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-06 22:38:45,367 INFO L168 Benchmark]: Boogie Preprocessor took 124.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-06 22:38:45,368 INFO L168 Benchmark]: RCFGBuilder took 677.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2018-11-06 22:38:45,369 INFO L168 Benchmark]: TraceAbstraction took 8827.78 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -166.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:38:45,374 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 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 392.70 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 61.62 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 124.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 677.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8827.78 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -166.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L75] FCALL char A [2 + 2 + 4 +1]; [L76] FCALL A[2 + 2 + 4] = 0 [L77] CALL parse_expression_list (A) [L49] int start=0, i=-1, j=-1; [L50] FCALL char str2[2]; [L51] COND FALSE !(!str) [L53] i++ [L54] FCALL str[i] [L55] case 0: [L70] EXPR, FCALL str[i] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] FCALL str[i] [L55] case 0: [L70] EXPR, FCALL str[i] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] FCALL str[i] [L55] case 0: [L56] EXPR, FCALL str[start] [L56] (str[start] == ' ') || (str[start] == '\t') [L56] EXPR, FCALL str[start] [L56] (str[start] == ' ') || (str[start] == '\t') [L56] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L57] EXPR, FCALL str[start] [L57] COND FALSE !(str[start] == '"') [L58] j = i-1 [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L59] EXPR, FCALL str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') [L59] EXPR, FCALL str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L59] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L60] (0 < j) && (str[j] == '"') [L60] EXPR, FCALL str[j] [L60] (0 < j) && (str[j] == '"') [L60] COND FALSE !((0 < j) && (str[j] == '"')) [L61] COND TRUE start<=j [L62] FCALL r_strncpy(str2, str+start, j-start+1) [L63] CALL __VERIFIER_assert(j - start + 1 < 2) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 1 error locations. UNSAFE Result, 8.7s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 924 SDtfs, 1805 SDslu, 2908 SDs, 0 SdLazy, 1606 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred 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: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 517 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 143818 SizeOfPredicates, 15 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 16/114 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...