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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:17:37,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:17:37,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:17:37,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:17:37,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:17:37,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:17:37,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:17:37,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:17:37,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:17:37,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:17:37,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:17:37,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:17:37,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:17:37,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:17:37,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:17:37,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:17:37,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:17:37,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:17:37,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:17:37,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:17:37,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:17:37,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:17:37,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:17:37,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:17:37,626 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:17:37,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:17:37,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:17:37,628 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:17:37,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:17:37,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:17:37,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:17:37,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:17:37,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:17:37,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:17:37,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:17:37,641 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:17:37,641 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:17:37,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:17:37,641 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:17:37,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:17:37,642 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:17:37,642 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:17:37,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:17:37,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:17:37,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:17:37,643 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:17:37,643 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:17:37,643 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:17:37,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:17:37,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:17:37,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:17:37,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:17:37,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:17:37,645 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:17:37,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:17:37,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:17:37,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:17:37,646 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:17:37,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:17:37,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:17:37,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:17:37,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:17:37,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:17:37,647 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:17:37,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:17:37,648 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:17:37,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:17:37,694 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:17:37,698 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:17:37,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:17:37,700 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:17:37,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-24 12:17:37,847 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:17:37,853 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:17:37,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:37,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:17:37,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:17:37,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:37" (1/1) ... [2018-01-24 12:17:37,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645ed8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:37, skipping insertion in model container [2018-01-24 12:17:37,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:37" (1/1) ... [2018-01-24 12:17:37,881 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:37,899 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:38,010 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:38,024 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:38,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38 WrapperNode [2018-01-24 12:17:38,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:38,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:17:38,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:17:38,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:17:38,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... [2018-01-24 12:17:38,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... [2018-01-24 12:17:38,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... [2018-01-24 12:17:38,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... [2018-01-24 12:17:38,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... [2018-01-24 12:17:38,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... [2018-01-24 12:17:38,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... [2018-01-24 12:17:38,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:17:38,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:17:38,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:17:38,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:17:38,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (1/1) ... No working directory specified, using /storage/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-01-24 12:17:38,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:17:38,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:17:38,114 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 12:17:38,114 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:17:38,114 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:17:38,114 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:17:38,114 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:17:38,114 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:17:38,115 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:17:38,115 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 12:17:38,115 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:17:38,115 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:17:38,115 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:17:38,267 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:17:38,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:38 BoogieIcfgContainer [2018-01-24 12:17:38,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:17:38,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:17:38,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:17:38,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:17:38,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:17:37" (1/3) ... [2018-01-24 12:17:38,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc41ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:38, skipping insertion in model container [2018-01-24 12:17:38,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:38" (2/3) ... [2018-01-24 12:17:38,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc41ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:38, skipping insertion in model container [2018-01-24 12:17:38,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:38" (3/3) ... [2018-01-24 12:17:38,274 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-24 12:17:38,283 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:17:38,291 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 12:17:38,327 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:17:38,327 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:17:38,327 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:17:38,327 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:17:38,327 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:17:38,327 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:17:38,328 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:17:38,328 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:17:38,328 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:17:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 12:17:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:17:38,355 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:38,356 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:38,356 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:38,361 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 12:17:38,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:38,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:38,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:38,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:38,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:38,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:38,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:38,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:17:38,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:17:38,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:17:38,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:38,553 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 12:17:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:38,633 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 12:17:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:17:38,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 12:17:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:38,642 INFO L225 Difference]: With dead ends: 101 [2018-01-24 12:17:38,642 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:17:38,644 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:17:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 12:17:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:17:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 12:17:38,740 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 12:17:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:38,741 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 12:17:38,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:17:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 12:17:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:17:38,742 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:38,742 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:38,742 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:38,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 12:17:38,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:38,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:38,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:38,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:38,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:38,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:38,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:38,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:17:38,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:17:38,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:17:38,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:38,890 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-24 12:17:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:39,087 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-24 12:17:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:17:39,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 12:17:39,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:39,090 INFO L225 Difference]: With dead ends: 129 [2018-01-24 12:17:39,090 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:17:39,091 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:17:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:17:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-01-24 12:17:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 12:17:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-01-24 12:17:39,101 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-01-24 12:17:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:39,102 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-01-24 12:17:39,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:17:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-01-24 12:17:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:17:39,103 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:39,103 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:39,103 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-24 12:17:39,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:39,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:39,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:39,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:39,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:39,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:39,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:39,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:39,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:39,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:39,192 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2018-01-24 12:17:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:39,284 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-24 12:17:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:39,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:17:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:39,286 INFO L225 Difference]: With dead ends: 77 [2018-01-24 12:17:39,286 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 12:17:39,287 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 12:17:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-01-24 12:17:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 12:17:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-01-24 12:17:39,297 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 17 [2018-01-24 12:17:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:39,298 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-01-24 12:17:39,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-01-24 12:17:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:17:39,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:39,299 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:39,299 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:39,299 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-24 12:17:39,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:39,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:39,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:39,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:39,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:39,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:39,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:17:39,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:39,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:39,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:39,352 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 5 states. [2018-01-24 12:17:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:39,393 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-24 12:17:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:39,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:17:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:39,394 INFO L225 Difference]: With dead ends: 68 [2018-01-24 12:17:39,394 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:17:39,395 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:17:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 12:17:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 12:17:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-24 12:17:39,403 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 17 [2018-01-24 12:17:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:39,404 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-24 12:17:39,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-24 12:17:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:17:39,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:39,404 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:39,404 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-24 12:17:39,405 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:39,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:39,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:39,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:39,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:39,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:39,517 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:17:39,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:39,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:39,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:39,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-01-24 12:17:39,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:17:39,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:17:39,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:39,648 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 12 states. [2018-01-24 12:17:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:39,813 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-01-24 12:17:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:17:39,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-01-24 12:17:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:39,814 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:17:39,814 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 12:17:39,815 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:17:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 12:17:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2018-01-24 12:17:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 12:17:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-24 12:17:39,823 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 22 [2018-01-24 12:17:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:39,824 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-24 12:17:39,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:17:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-24 12:17:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:17:39,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:39,825 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:39,825 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-01-24 12:17:39,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:39,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:39,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:39,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:39,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:17:39,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:39,875 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:17:39,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:39,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:17:39,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:39,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-24 12:17:39,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:17:39,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:17:39,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:39,934 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-01-24 12:17:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:40,016 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-24 12:17:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:40,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 12:17:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:40,017 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:17:40,018 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 12:17:40,018 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 12:17:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-01-24 12:17:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 12:17:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-24 12:17:40,032 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 29 [2018-01-24 12:17:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:40,032 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-24 12:17:40,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:17:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-24 12:17:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 12:17:40,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:40,034 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:40,034 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash 465858064, now seen corresponding path program 1 times [2018-01-24 12:17:40,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:40,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:40,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:40,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:40,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:40,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:17:40,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:40,232 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:17:40,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:40,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 12:17:40,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:40,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2018-01-24 12:17:40,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:17:40,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:17:40,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:17:40,304 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 11 states. [2018-01-24 12:17:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:40,453 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 12:17:40,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:17:40,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-01-24 12:17:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:40,455 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:17:40,455 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 12:17:40,455 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:17:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 12:17:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-01-24 12:17:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 12:17:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-01-24 12:17:40,467 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2018-01-24 12:17:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:40,467 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-01-24 12:17:40,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:17:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-01-24 12:17:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:17:40,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:40,469 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:40,469 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:40,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1556698143, now seen corresponding path program 1 times [2018-01-24 12:17:40,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:40,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:40,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:40,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:40,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:40,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:17:40,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:40,697 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:17:40,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:40,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:40,749 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-01-24 12:17:40,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:40,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:40,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:17:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:17:40,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:40,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-01-24 12:17:40,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:17:40,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:17:40,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:17:40,857 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 13 states. [2018-01-24 12:17:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:41,042 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-24 12:17:41,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:17:41,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-01-24 12:17:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:41,044 INFO L225 Difference]: With dead ends: 89 [2018-01-24 12:17:41,044 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 12:17:41,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:17:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 12:17:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2018-01-24 12:17:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 12:17:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-24 12:17:41,051 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 41 [2018-01-24 12:17:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:41,051 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-24 12:17:41,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:17:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-24 12:17:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 12:17:41,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:41,052 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:41,052 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 1 times [2018-01-24 12:17:41,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:41,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:41,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:41,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:41,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:41,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:17:41,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:41,116 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:41,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:41,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:17:41,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:41,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-24 12:17:41,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:17:41,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:17:41,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:17:41,211 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 9 states. [2018-01-24 12:17:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:41,306 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-24 12:17:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:17:41,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-24 12:17:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:41,308 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:17:41,308 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 12:17:41,308 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 12:17:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2018-01-24 12:17:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:17:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-24 12:17:41,317 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 49 [2018-01-24 12:17:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:41,317 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-24 12:17:41,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:17:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-24 12:17:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-24 12:17:41,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:41,320 INFO L322 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:41,320 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash 454321712, now seen corresponding path program 2 times [2018-01-24 12:17:41,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:41,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:41,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:41,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:41,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:41,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-24 12:17:41,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:41,455 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:17:41,473 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:41,484 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:41,489 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:41,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:41,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:41,530 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 5 [2018-01-24 12:17:41,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:41,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:41,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:41,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:41,562 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 5 [2018-01-24 12:17:41,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:41,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:41,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:41,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:41,597 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 5 [2018-01-24 12:17:41,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:41,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:17:41,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:41,625 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-24 12:17:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-24 12:17:41,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:41,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-01-24 12:17:41,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:17:41,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:17:41,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-01-24 12:17:41,672 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 10 states. [2018-01-24 12:17:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:41,930 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2018-01-24 12:17:41,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:17:41,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-01-24 12:17:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:41,931 INFO L225 Difference]: With dead ends: 138 [2018-01-24 12:17:41,931 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:17:41,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=250, Unknown=1, NotChecked=34, Total=380 [2018-01-24 12:17:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:17:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:17:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:17:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:17:41,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-01-24 12:17:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:41,933 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:17:41,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:17:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:17:41,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:17:41,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:17:42,540 WARN L146 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 67 DAG size of output 45 [2018-01-24 12:17:42,733 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-24 12:17:42,733 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 37) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point L17''''(lines 17 19) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 14 21) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 14 21) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L397 ceAbstractionStarter]: At program point L17'''(lines 17 19) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse2 (not (= 32 (select |#length| |foo_#in~b.base|)))) (.cse4 (= foo_~i~1 0))) (and (let ((.cse3 (= foo_~size 0))) (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) .cse2 (and .cse3 (= 1 foo_~i~1)) (and .cse3 .cse4))) (or (< 31 |foo_#in~size|) .cse0 .cse1 .cse2 (let ((.cse5 (= 1 (select |#valid| foo_~b.base))) (.cse6 (select |#length| foo_~b.base)) (.cse7 (<= foo_~size 31)) (.cse8 (= foo_~b.offset 0))) (or (and .cse5 (= 32 .cse6) .cse7 .cse8 .cse4) (and (and .cse5 (<= 1 foo_~i~1)) (= .cse6 32) .cse7 .cse8)))))) [2018-01-24 12:17:42,734 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 14 21) the Hoare annotation is: true [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point L17''(lines 17 19) no Hoare annotation was computed. [2018-01-24 12:17:42,734 INFO L401 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 18) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 37) the Hoare annotation is: true [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 23 35) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-24 12:17:42,735 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 (<= main_~i~3 31)))) [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L25'(line 25) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L397 ceAbstractionStarter]: At program point L29'''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3))) [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L26''''(lines 26 28) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L25''(line 25) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 23 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 12:17:42,736 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 12:17:42,737 INFO L401 ceAbstractionStarter]: For program point L26''(lines 26 28) no Hoare annotation was computed. [2018-01-24 12:17:42,737 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 12:17:42,737 INFO L397 ceAbstractionStarter]: At program point L26'''(lines 26 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3))) [2018-01-24 12:17:42,737 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 12:17:42,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:17:42 BoogieIcfgContainer [2018-01-24 12:17:42,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:17:42,759 INFO L168 Benchmark]: Toolchain (without parser) took 4911.15 ms. Allocated memory was 302.5 MB in the beginning and 509.6 MB in the end (delta: 207.1 MB). Free memory was 263.5 MB in the beginning and 362.1 MB in the end (delta: -98.5 MB). Peak memory consumption was 159.5 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:42,760 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:17:42,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.88 ms. Allocated memory is still 302.5 MB. Free memory was 262.6 MB in the beginning and 254.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:42,761 INFO L168 Benchmark]: Boogie Preprocessor took 29.98 ms. Allocated memory is still 302.5 MB. Free memory was 254.5 MB in the beginning and 252.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:42,761 INFO L168 Benchmark]: RCFGBuilder took 206.29 ms. Allocated memory is still 302.5 MB. Free memory was 252.4 MB in the beginning and 237.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:42,761 INFO L168 Benchmark]: TraceAbstraction took 4489.22 ms. Allocated memory was 302.5 MB in the beginning and 509.6 MB in the end (delta: 207.1 MB). Free memory was 236.8 MB in the beginning and 362.1 MB in the end (delta: -125.2 MB). Peak memory consumption was 132.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:42,763 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.17 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.88 ms. Allocated memory is still 302.5 MB. Free memory was 262.6 MB in the beginning and 254.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.98 ms. Allocated memory is still 302.5 MB. Free memory was 254.5 MB in the beginning and 252.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 206.29 ms. Allocated memory is still 302.5 MB. Free memory was 252.4 MB in the beginning and 237.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4489.22 ms. Allocated memory was 302.5 MB in the beginning and 509.6 MB in the end (delta: 207.1 MB). Free memory was 236.8 MB in the beginning and 362.1 MB in the end (delta: -125.2 MB). Peak memory consumption was 132.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 18]: array index is always in bounds For all program executions holds that array index is always in bounds 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: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2018-01-24 12:17:42,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,771 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,771 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,771 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,772 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(32 == unknown-#length-unknown[b])) || (size == 0 && 1 == i)) || (size == 0 && i == 0)) && ((((31 < \old(size) || !(0 == b)) || !(\valid[b] == 1)) || !(32 == unknown-#length-unknown[b])) || ((((1 == \valid[b] && 32 == unknown-#length-unknown[b]) && size <= 31) && b == 0) && i == 0) || ((((1 == \valid[b] && 1 <= i) && unknown-#length-unknown[b] == 32) && size <= 31) && b == 0)) - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 12:17:42,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 26]: Loop Invariant [2018-01-24 12:17:42,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:42,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 4.4s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 353 SDtfs, 739 SDslu, 1159 SDs, 0 SdLazy, 947 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 238 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=9, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 128 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 46 NumberOfFragments, 252 HoareAnnotationTreeSize, 25 FomulaSimplifications, 2000 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 707 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 569 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 553 ConstructedInterpolants, 50 QuantifiedInterpolants, 99307 SizeOfPredicates, 9 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 257/308 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-17-42-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-17-42-782.csv Received shutdown request...