java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:10:24,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:10:24,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:10:24,711 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:10:24,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:10:24,712 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:10:24,713 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:10:24,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:10:24,716 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:10:24,717 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:10:24,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:10:24,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:10:24,719 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:10:24,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:10:24,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:10:24,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:10:24,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:10:24,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:10:24,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:10:24,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:10:24,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:10:24,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:10:24,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:10:24,730 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:10:24,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:10:24,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:10:24,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:10:24,732 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:10:24,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:10:24,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:10:24,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:10:24,733 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:10:24,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:10:24,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:10:24,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:10:24,744 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:10:24,744 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:10:24,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:10:24,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:10:24,744 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:10:24,745 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:10:24,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:10:24,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:10:24,745 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:10:24,745 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:10:24,745 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:10:24,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:10:24,746 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:10:24,746 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:10:24,746 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:10:24,746 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:10:24,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:10:24,747 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:10:24,747 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:10:24,747 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:10:24,747 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:10:24,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:10:24,789 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:10:24,794 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:10:24,795 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:10:24,796 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:10:24,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:24,942 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:10:24,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:10:24,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:24,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:10:24,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:10:24,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:24" (1/1) ... [2018-02-04 12:10:24,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ad6ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:24, skipping insertion in model container [2018-02-04 12:10:24,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:24" (1/1) ... [2018-02-04 12:10:24,967 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:24,994 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:25,094 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:25,105 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:25,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25 WrapperNode [2018-02-04 12:10:25,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:25,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:10:25,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:10:25,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:10:25,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... [2018-02-04 12:10:25,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... [2018-02-04 12:10:25,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... [2018-02-04 12:10:25,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... [2018-02-04 12:10:25,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... [2018-02-04 12:10:25,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... [2018-02-04 12:10:25,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... [2018-02-04 12:10:25,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:10:25,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:10:25,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:10:25,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:10:25,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 12:10:25,171 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:10:25,171 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:10:25,171 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-02-04 12:10:25,171 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:10:25,171 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:10:25,171 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:10:25,171 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:10:25,171 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:10:25,171 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:10:25,172 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:10:25,172 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-02-04 12:10:25,172 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:10:25,172 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:10:25,172 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:10:25,318 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:10:25,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:25 BoogieIcfgContainer [2018-02-04 12:10:25,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:10:25,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:10:25,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:10:25,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:10:25,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:10:24" (1/3) ... [2018-02-04 12:10:25,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31980fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:25, skipping insertion in model container [2018-02-04 12:10:25,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:25" (2/3) ... [2018-02-04 12:10:25,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31980fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:25, skipping insertion in model container [2018-02-04 12:10:25,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:25" (3/3) ... [2018-02-04 12:10:25,323 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:25,328 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:10:25,333 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 12:10:25,363 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:10:25,363 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:10:25,363 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:10:25,363 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:10:25,363 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:10:25,363 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:10:25,363 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:10:25,363 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:10:25,364 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:10:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-04 12:10:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:10:25,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:25,378 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:25,378 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510132, now seen corresponding path program 1 times [2018-02-04 12:10:25,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:25,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:25,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:25,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:25,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:25,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:25,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:25,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:25,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:25,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:25,611 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-04 12:10:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:25,661 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 12:10:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:10:25,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:10:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:25,668 INFO L225 Difference]: With dead ends: 44 [2018-02-04 12:10:25,668 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 12:10:25,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 12:10:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 12:10:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 12:10:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 12:10:25,694 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-04 12:10:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:25,694 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 12:10:25,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 12:10:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:10:25,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:25,695 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:25,695 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510131, now seen corresponding path program 1 times [2018-02-04 12:10:25,695 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:25,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:25,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,696 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:25,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:25,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:25,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:25,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:25,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:25,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:25,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:25,798 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-04 12:10:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:25,845 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 12:10:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:25,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:10:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:25,846 INFO L225 Difference]: With dead ends: 40 [2018-02-04 12:10:25,846 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 12:10:25,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:10:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 12:10:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 12:10:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 12:10:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 12:10:25,850 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-04 12:10:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:25,850 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 12:10:25,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 12:10:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:10:25,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:25,851 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:25,851 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695343, now seen corresponding path program 1 times [2018-02-04 12:10:25,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:25,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:25,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,852 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:25,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:25,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:25,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:25,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:25,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:25,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:25,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:25,877 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-04 12:10:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:25,903 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 12:10:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:10:25,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:10:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:25,904 INFO L225 Difference]: With dead ends: 39 [2018-02-04 12:10:25,904 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 12:10:25,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-04 12:10:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 12:10:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 12:10:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 12:10:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 12:10:25,908 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-04 12:10:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:25,909 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 12:10:25,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 12:10:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:10:25,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:25,909 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:25,910 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:25,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695344, now seen corresponding path program 1 times [2018-02-04 12:10:25,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:25,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:25,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:25,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:25,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:25,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:25,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:10:25,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:10:25,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:10:25,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:25,973 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-04 12:10:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:26,010 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-04 12:10:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:26,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:10:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:26,011 INFO L225 Difference]: With dead ends: 38 [2018-02-04 12:10:26,011 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 12:10:26,012 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 12:10:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 12:10:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 12:10:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 12:10:26,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-04 12:10:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:26,017 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 12:10:26,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:10:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 12:10:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:10:26,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:26,018 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:26,018 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash -559562515, now seen corresponding path program 1 times [2018-02-04 12:10:26,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:26,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:26,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:26,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:26,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:26,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:26,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:26,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:26,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:26,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:26,078 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-04 12:10:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:26,124 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-04 12:10:26,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:26,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 12:10:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:26,125 INFO L225 Difference]: With dead ends: 37 [2018-02-04 12:10:26,125 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 12:10:26,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:10:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 12:10:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 12:10:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 12:10:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-04 12:10:26,127 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-02-04 12:10:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:26,127 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-04 12:10:26,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-04 12:10:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:10:26,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:26,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:26,128 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash -559562514, now seen corresponding path program 1 times [2018-02-04 12:10:26,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:26,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:26,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,130 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:26,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:26,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:26,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:26,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:10:26,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:10:26,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:10:26,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:10:26,225 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-04 12:10:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:26,341 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 12:10:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:10:26,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 12:10:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:26,342 INFO L225 Difference]: With dead ends: 40 [2018-02-04 12:10:26,342 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 12:10:26,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:10:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 12:10:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-04 12:10:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 12:10:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 12:10:26,345 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-02-04 12:10:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:26,345 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 12:10:26,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:10:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 12:10:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:10:26,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:26,346 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:26,346 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796544, now seen corresponding path program 1 times [2018-02-04 12:10:26,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:26,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:26,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:26,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:26,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:26,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:26,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:10:26,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:10:26,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:10:26,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:10:26,388 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-02-04 12:10:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:26,446 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 12:10:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:10:26,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 12:10:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:26,447 INFO L225 Difference]: With dead ends: 39 [2018-02-04 12:10:26,447 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 12:10:26,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:10:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 12:10:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-02-04 12:10:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 12:10:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 12:10:26,451 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-02-04 12:10:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:26,452 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 12:10:26,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:10:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 12:10:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:10:26,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:26,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:26,453 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796543, now seen corresponding path program 1 times [2018-02-04 12:10:26,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:26,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:26,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:26,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:26,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:26,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:26,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:10:26,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:10:26,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:10:26,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:10:26,551 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-02-04 12:10:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:26,636 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-04 12:10:26,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:10:26,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 12:10:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:26,636 INFO L225 Difference]: With dead ends: 42 [2018-02-04 12:10:26,636 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 12:10:26,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:10:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 12:10:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-02-04 12:10:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 12:10:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 12:10:26,638 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2018-02-04 12:10:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:26,639 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 12:10:26,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:10:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 12:10:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:10:26,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:26,639 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:10:26,640 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:26,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1264210553, now seen corresponding path program 1 times [2018-02-04 12:10:26,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:26,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:26,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:26,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:26,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:26,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:26,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 12:10:26,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:10:26,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:10:26,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:10:26,833 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 14 states. [2018-02-04 12:10:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:27,070 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-04 12:10:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:10:27,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-04 12:10:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:27,071 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:10:27,071 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:10:27,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:10:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:10:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-02-04 12:10:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:10:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 12:10:27,074 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 26 [2018-02-04 12:10:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:27,074 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 12:10:27,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:10:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 12:10:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:10:27,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:27,075 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:10:27,075 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1264212731, now seen corresponding path program 1 times [2018-02-04 12:10:27,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:27,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:27,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:27,076 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:27,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:27,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:27,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:27,231 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:10:27,236 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:27,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:27,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:10:27,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:10:27,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:27,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:27,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:27,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:10:27,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 12:10:27,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:10:27,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:27,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:27,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:27,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-04 12:10:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:27,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:27,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-02-04 12:10:27,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:10:27,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:10:27,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:10:27,548 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 21 states. [2018-02-04 12:10:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:29,616 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-02-04 12:10:29,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:10:29,616 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-02-04 12:10:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:29,619 INFO L225 Difference]: With dead ends: 86 [2018-02-04 12:10:29,619 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 12:10:29,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=949, Unknown=1, NotChecked=0, Total=1122 [2018-02-04 12:10:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 12:10:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-02-04 12:10:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 12:10:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 12:10:29,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 26 [2018-02-04 12:10:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:29,625 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 12:10:29,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:10:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 12:10:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:10:29,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:29,626 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:10:29,627 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash 446562103, now seen corresponding path program 1 times [2018-02-04 12:10:29,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:29,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:29,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:29,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:29,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:29,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:29,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:29,928 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:10:29,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:29,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:29,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:29,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:29,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:29,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:10:30,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:30,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:30,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:10:30,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:30,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:30,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:10:30,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:10:30,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:10:30,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:30,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:30,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:30,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:10:30,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 12:10:30,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:10:30,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:30,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:30,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:30,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:10:30,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-02-04 12:10:30,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:10:30,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:30,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-04 12:10:30,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:30,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:30,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:30,277 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-04 12:10:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:30,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:30,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-02-04 12:10:30,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:10:30,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:10:30,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:10:30,374 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 28 states. [2018-02-04 12:10:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:31,103 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-04 12:10:31,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:10:31,104 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 [2018-02-04 12:10:31,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:31,105 INFO L225 Difference]: With dead ends: 92 [2018-02-04 12:10:31,105 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 12:10:31,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 12:10:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 12:10:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-02-04 12:10:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 12:10:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-02-04 12:10:31,111 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 26 [2018-02-04 12:10:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:31,111 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-02-04 12:10:31,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:10:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-02-04 12:10:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:10:31,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:31,112 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:10:31,112 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash -53536959, now seen corresponding path program 2 times [2018-02-04 12:10:31,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:31,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:31,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:31,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:31,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:31,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:31,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:31,364 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:10:31,372 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:10:31,394 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:10:31,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:31,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:31,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:10:31,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:10:31,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:31,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:31,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:31,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:10:31,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-02-04 12:10:31,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:31,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-02-04 12:10:31,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:31,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:31,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:31,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-02-04 12:10:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:31,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:31,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-04 12:10:31,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 12:10:31,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 12:10:31,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:10:31,802 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 27 states. [2018-02-04 12:10:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:34,762 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-02-04 12:10:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:10:34,763 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2018-02-04 12:10:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:34,764 INFO L225 Difference]: With dead ends: 104 [2018-02-04 12:10:34,764 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 12:10:34,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:10:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 12:10:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 65. [2018-02-04 12:10:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 12:10:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-02-04 12:10:34,770 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 31 [2018-02-04 12:10:34,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:34,770 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-02-04 12:10:34,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 12:10:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-02-04 12:10:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:10:34,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:34,771 INFO L351 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] [2018-02-04 12:10:34,771 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:34,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1129910615, now seen corresponding path program 1 times [2018-02-04 12:10:34,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:34,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:34,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:34,773 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:10:34,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:34,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:34,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:34,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:10:34,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:10:34,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:10:34,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:10:34,895 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 7 states. [2018-02-04 12:10:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:34,970 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 12:10:34,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:10:34,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 12:10:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:34,971 INFO L225 Difference]: With dead ends: 64 [2018-02-04 12:10:34,971 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 12:10:34,972 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:10:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 12:10:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 12:10:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 12:10:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-02-04 12:10:34,974 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-02-04 12:10:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:34,974 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-02-04 12:10:34,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:10:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-02-04 12:10:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 12:10:34,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:34,975 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:34,975 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-04 12:10:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash -373803070, now seen corresponding path program 2 times [2018-02-04 12:10:34,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:34,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:34,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:34,976 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:34,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:34,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:35,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:35,232 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:10:35,236 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:10:35,251 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:10:35,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:35,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:35,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:35,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:10:35,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:10:35,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:35,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:35,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:10:35,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:10:35,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 12:10:35,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:10:35,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:10:35,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:35,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-04 12:10:35,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 12:10:35,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:10:35,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:35,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:10:35,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-02-04 12:10:36,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-02-04 12:10:36,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:10:36,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:36,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-02-04 12:10:36,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:36,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:36,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:10:36,109 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:69 [2018-02-04 12:10:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:36,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:36,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 39 [2018-02-04 12:10:36,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 12:10:36,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 12:10:36,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:10:36,335 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 40 states. [2018-02-04 12:10:38,089 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 109 DAG size of output 66 [2018-02-04 12:10:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:39,326 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 12:10:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 12:10:39,326 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 34 [2018-02-04 12:10:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:39,326 INFO L225 Difference]: With dead ends: 60 [2018-02-04 12:10:39,326 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:10:39,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=563, Invalid=4987, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 12:10:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:10:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:10:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:10:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:10:39,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-02-04 12:10:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:39,328 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:10:39,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 12:10:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:10:39,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:10:39,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:10:39 BoogieIcfgContainer [2018-02-04 12:10:39,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:10:39,331 INFO L168 Benchmark]: Toolchain (without parser) took 14388.79 ms. Allocated memory was 403.2 MB in the beginning and 762.8 MB in the end (delta: 359.7 MB). Free memory was 360.0 MB in the beginning and 642.0 MB in the end (delta: -282.0 MB). Peak memory consumption was 77.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:39,332 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 365.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:10:39,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.12 ms. Allocated memory is still 403.2 MB. Free memory was 360.0 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:39,332 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 346.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:39,332 INFO L168 Benchmark]: RCFGBuilder took 185.14 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 330.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:39,333 INFO L168 Benchmark]: TraceAbstraction took 14011.63 ms. Allocated memory was 403.2 MB in the beginning and 762.8 MB in the end (delta: 359.7 MB). Free memory was 327.5 MB in the beginning and 642.0 MB in the end (delta: -314.5 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:39,333 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 365.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.12 ms. Allocated memory is still 403.2 MB. Free memory was 360.0 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.11 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 346.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 185.14 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 330.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14011.63 ms. Allocated memory was 403.2 MB in the beginning and 762.8 MB in the end (delta: 359.7 MB). Free memory was 327.5 MB in the beginning and 642.0 MB in the end (delta: -314.5 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. SAFE Result, 13.9s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 409 SDtfs, 988 SDslu, 2101 SDs, 0 SdLazy, 2649 SolverSat, 308 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=11, 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 72 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 406 ConstructedInterpolants, 45 QuantifiedInterpolants, 132138 SizeOfPredicates, 66 NumberOfNonLiveVariables, 615 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 7/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-10-39-338.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-10-39-338.csv Received shutdown request...