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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:54:46,617 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:54:46,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:54:46,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:54:46,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:54:46,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:54:46,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:54:46,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:54:46,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:54:46,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:54:46,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:54:46,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:54:46,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:54:46,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:54:46,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:54:46,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:54:46,645 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:54:46,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:54:46,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:54:46,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:54:46,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:54:46,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:54:46,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:54:46,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:54:46,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:54:46,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:54:46,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:54:46,656 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:54:46,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:54:46,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:54:46,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:54:46,658 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:54:46,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:54:46,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:54:46,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:54:46,669 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:54:46,669 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:54:46,669 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:54:46,669 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:54:46,670 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:54:46,670 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:54:46,671 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:54:46,671 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:54:46,671 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:54:46,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:54:46,671 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:54:46,672 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:54:46,672 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:54:46,672 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:54:46,672 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:54:46,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:54:46,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:54:46,673 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:54:46,673 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:54:46,673 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:54:46,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:54:46,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:54:46,674 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:54:46,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:54:46,674 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:54:46,674 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:54:46,675 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:54:46,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:54:46,675 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:54:46,676 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:54:46,676 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:54:46,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:54:46,726 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:54:46,730 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:54:46,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:54:46,732 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:54:46,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:54:46,932 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:54:46,938 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:54:46,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:54:46,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:54:46,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:54:46,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:54:46" (1/1) ... [2018-01-24 12:54:46,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8bf943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:46, skipping insertion in model container [2018-01-24 12:54:46,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:54:46" (1/1) ... [2018-01-24 12:54:46,967 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:54:47,009 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:54:47,120 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:54:47,134 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:54:47,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47 WrapperNode [2018-01-24 12:54:47,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:54:47,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:54:47,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:54:47,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:54:47,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (1/1) ... [2018-01-24 12:54:47,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (1/1) ... [2018-01-24 12:54:47,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (1/1) ... [2018-01-24 12:54:47,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (1/1) ... [2018-01-24 12:54:47,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (1/1) ... [2018-01-24 12:54:47,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (1/1) ... [2018-01-24 12:54:47,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (1/1) ... [2018-01-24 12:54:47,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:54:47,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:54:47,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:54:47,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:54:47,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (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:54:47,227 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:54:47,227 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:54:47,227 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-01-24 12:54:47,227 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:54:47,227 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:54:47,228 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:54:47,228 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:54:47,228 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:54:47,228 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:54:47,228 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:54:47,228 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-01-24 12:54:47,229 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:54:47,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:54:47,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:54:47,386 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:54:47,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:54:47 BoogieIcfgContainer [2018-01-24 12:54:47,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:54:47,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:54:47,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:54:47,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:54:47,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:54:46" (1/3) ... [2018-01-24 12:54:47,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee00ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:54:47, skipping insertion in model container [2018-01-24 12:54:47,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:54:47" (2/3) ... [2018-01-24 12:54:47,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee00ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:54:47, skipping insertion in model container [2018-01-24 12:54:47,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:54:47" (3/3) ... [2018-01-24 12:54:47,393 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:54:47,402 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:54:47,407 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 12:54:47,451 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:54:47,451 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:54:47,451 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:54:47,451 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:54:47,451 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:54:47,451 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:54:47,451 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:54:47,451 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:54:47,452 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:54:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-01-24 12:54:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:54:47,473 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:47,473 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:54:47,474 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-01-24 12:54:47,481 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:47,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:47,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:47,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:47,528 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:47,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:47,651 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:54:47,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:54:47,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:54:47,654 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:47,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:54:47,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:54:47,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:54:47,674 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-01-24 12:54:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:47,843 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 12:54:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:54:47,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-24 12:54:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:47,852 INFO L225 Difference]: With dead ends: 45 [2018-01-24 12:54:47,852 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 12:54:47,854 INFO L525 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-01-24 12:54:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 12:54:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 12:54:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 12:54:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-01-24 12:54:47,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-01-24 12:54:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:47,881 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-01-24 12:54:47,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:54:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-01-24 12:54:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:54:47,881 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:47,882 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:54:47,882 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-01-24 12:54:47,882 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:47,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:47,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:47,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:47,883 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:47,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:48,019 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:54:48,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:54:48,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:54:48,020 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:48,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:54:48,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:54:48,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:54:48,023 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-01-24 12:54:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:48,099 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-01-24 12:54:48,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:54:48,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-24 12:54:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:48,100 INFO L225 Difference]: With dead ends: 30 [2018-01-24 12:54:48,100 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 12:54:48,101 INFO L525 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-01-24 12:54:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 12:54:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 12:54:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 12:54:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-01-24 12:54:48,107 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-01-24 12:54:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:48,107 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-01-24 12:54:48,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:54:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-01-24 12:54:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:54:48,108 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:48,108 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:54:48,108 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-01-24 12:54:48,109 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:48,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:48,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,110 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:48,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:48,185 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:54:48,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:54:48,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:54:48,185 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:48,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:54:48,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:54:48,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:54:48,187 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-01-24 12:54:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:48,233 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-01-24 12:54:48,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:54:48,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 12:54:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:48,234 INFO L225 Difference]: With dead ends: 29 [2018-01-24 12:54:48,235 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 12:54:48,235 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:54:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 12:54:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-24 12:54:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 12:54:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-01-24 12:54:48,241 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-01-24 12:54:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:48,241 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-01-24 12:54:48,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:54:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-01-24 12:54:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:54:48,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:48,242 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:54:48,242 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-01-24 12:54:48,243 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:48,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:48,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,244 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:48,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:48,472 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:54:48,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:54:48,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:54:48,472 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:48,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:54:48,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:54:48,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:54:48,473 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-01-24 12:54:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:48,553 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-01-24 12:54:48,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:54:48,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 12:54:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:48,556 INFO L225 Difference]: With dead ends: 38 [2018-01-24 12:54:48,557 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 12:54:48,557 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:54:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 12:54:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-01-24 12:54:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 12:54:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-01-24 12:54:48,563 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-01-24 12:54:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:48,564 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-01-24 12:54:48,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:54:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-01-24 12:54:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:54:48,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:48,564 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:54:48,565 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-01-24 12:54:48,565 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:48,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:48,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:48,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:48,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:54:48,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:54:48,612 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:48,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:54:48,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:54:48,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:54:48,613 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-01-24 12:54:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:48,624 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-01-24 12:54:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:54:48,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-24 12:54:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:48,625 INFO L225 Difference]: With dead ends: 47 [2018-01-24 12:54:48,626 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 12:54:48,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:54:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 12:54:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 12:54:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 12:54:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-01-24 12:54:48,630 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-01-24 12:54:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:48,631 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-01-24 12:54:48,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:54:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-01-24 12:54:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:54:48,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:48,632 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:54:48,632 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-01-24 12:54:48,632 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:48,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:48,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:48,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:48,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:48,749 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:54:48,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:54:48,750 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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:54:48,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:48,760 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:54:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:48,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:54:48,847 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 11 treesize of output 8 [2018-01-24 12:54:48,853 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 8 treesize of output 7 [2018-01-24 12:54:48,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 12:54:48,913 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 15 treesize of output 11 [2018-01-24 12:54:48,916 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 11 treesize of output 3 [2018-01-24 12:54:48,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-24 12:54:48,940 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:54:48,941 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:54:48,964 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 13 treesize of output 11 [2018-01-24 12:54:48,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-01-24 12:54:48,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:48,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 12:54:48,993 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:54:49,027 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:54:49,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 12 [2018-01-24 12:54:49,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:49,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:54:49,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:54:49,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:54:49,028 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-01-24 12:54:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:49,349 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-24 12:54:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:54:49,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 12:54:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:49,351 INFO L225 Difference]: With dead ends: 68 [2018-01-24 12:54:49,352 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 12:54:49,352 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:54:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 12:54:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-01-24 12:54:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:54:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-24 12:54:49,361 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-01-24 12:54:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:49,361 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-24 12:54:49,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:54:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-24 12:54:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:54:49,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:49,363 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:54:49,363 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:49,363 INFO L82 PathProgramCache]: Analyzing trace with hash 381472632, now seen corresponding path program 1 times [2018-01-24 12:54:49,363 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:49,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:49,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:49,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:49,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:49,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:49,490 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:54:49,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:54:49,490 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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:54:49,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:49,497 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:54:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:49,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:54:49,536 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-01-24 12:54:49,537 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-01-24 12:54:49,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:49,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:49,543 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-01-24 12:54:49,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:54:49,630 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 18 treesize of output 14 [2018-01-24 12:54:49,644 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 14 treesize of output 11 [2018-01-24 12:54:49,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:54:49,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:49,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:49,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:54:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:49,789 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:54:50,033 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 12:54:50,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:50,044 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 13 treesize of output 11 [2018-01-24 12:54:50,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:54:50,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:50,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:50,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:50,064 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:54:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:50,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:54:50,095 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:54:50,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:50,099 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:54:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:50,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:54:50,148 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:54:50,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:54:50,243 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:54:50,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:54:50,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9, 7, 7] total 27 [2018-01-24 12:54:50,244 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:54:50,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:54:50,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:54:50,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:54:50,245 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 15 states. [2018-01-24 12:54:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:51,229 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-01-24 12:54:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:54:51,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-01-24 12:54:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:51,232 INFO L225 Difference]: With dead ends: 120 [2018-01-24 12:54:51,232 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 12:54:51,233 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 12:54:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 12:54:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2018-01-24 12:54:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 12:54:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-01-24 12:54:51,246 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-01-24 12:54:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:51,247 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-01-24 12:54:51,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:54:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-01-24 12:54:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:54:51,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:51,248 INFO L322 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] [2018-01-24 12:54:51,248 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:51,248 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-01-24 12:54:51,249 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:51,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:51,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:51,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:51,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:51,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:51,370 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:54:51,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:54:51,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:54:51,370 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:51,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:54:51,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:54:51,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:54:51,371 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-01-24 12:54:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:51,457 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-24 12:54:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:54:51,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 12:54:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:51,460 INFO L225 Difference]: With dead ends: 101 [2018-01-24 12:54:51,460 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:54:51,461 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:54:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:54:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-01-24 12:54:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:54:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-01-24 12:54:51,482 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-01-24 12:54:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:51,482 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-01-24 12:54:51,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:54:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-01-24 12:54:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:54:51,485 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:51,485 INFO L322 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] [2018-01-24 12:54:51,485 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-01-24 12:54:51,486 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:51,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:51,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:51,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:51,487 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:51,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:51,564 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:54:51,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:54:51,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:54:51,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:54:51,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:54:51,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:54:51,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:54:51,604 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2018-01-24 12:54:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:51,646 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-24 12:54:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:54:51,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 12:54:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:51,647 INFO L225 Difference]: With dead ends: 77 [2018-01-24 12:54:51,647 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 12:54:51,647 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:54:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 12:54:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 12:54:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 12:54:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-01-24 12:54:51,653 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 23 [2018-01-24 12:54:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:51,653 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-01-24 12:54:51,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:54:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-01-24 12:54:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:54:51,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:54:51,654 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:54:51,654 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:54:51,654 INFO L82 PathProgramCache]: Analyzing trace with hash -698858542, now seen corresponding path program 1 times [2018-01-24 12:54:51,655 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:54:51,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:51,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:51,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:54:51,656 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:54:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:51,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:54:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:51,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:54:51,964 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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:54:51,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:51,970 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:54:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:51,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:54:51,991 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:54:51,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:51,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:51,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:54:52,023 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 15 treesize of output 12 [2018-01-24 12:54:52,025 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 12 treesize of output 11 [2018-01-24 12:54:52,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:54:52,126 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 19 treesize of output 15 [2018-01-24 12:54:52,144 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 15 treesize of output 12 [2018-01-24 12:54:52,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:54:52,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:52,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:52,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 12:54:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:52,238 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:54:52,552 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 13 treesize of output 11 [2018-01-24 12:54:52,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:54:52,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:52,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:54:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:52,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:54:52,668 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:54:52,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:54:52,671 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:54:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:54:52,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:54:52,716 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:54:52,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:54:52,723 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 16 treesize of output 13 [2018-01-24 12:54:52,725 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-01-24 12:54:52,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:52,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 12:54:52,810 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 19 treesize of output 15 [2018-01-24 12:54:52,816 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 15 treesize of output 12 [2018-01-24 12:54:52,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:54:52,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:52,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:52,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-01-24 12:54:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:52,843 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:54:53,070 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 13 treesize of output 11 [2018-01-24 12:54:53,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:54:53,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:54:53,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:54:53,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:54:53,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 12:54:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:54:53,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:54:53,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 11, 11] total 39 [2018-01-24 12:54:53,178 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:54:53,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:54:53,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:54:53,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 12:54:53,179 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 20 states. [2018-01-24 12:54:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:54:53,713 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-24 12:54:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:54:53,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-24 12:54:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:54:53,713 INFO L225 Difference]: With dead ends: 32 [2018-01-24 12:54:53,714 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:54:53,714 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=367, Invalid=2183, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 12:54:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:54:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:54:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:54:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:54:53,715 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-24 12:54:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:54:53,715 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:54:53,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:54:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:54:53,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:54:53,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:54:53,780 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:54:54,413 WARN L146 SmtUtils]: Spent 627ms on a formula simplification. DAG size of input: 107 DAG size of output 86 [2018-01-24 12:54:54,504 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point cstrnlenFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point cstrnlenErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point L544''''''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point cstrnlenEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 12:54:54,505 INFO L397 ceAbstractionStarter]: At program point L544'''''''(lines 544 545) the Hoare annotation is: (let ((.cse10 (div cstrnlen_~maxlen 4294967296)) (.cse14 (select |#length| cstrnlen_~cp~2.base))) (let ((.cse11 (<= (+ cstrnlen_~cp~2.offset 1) .cse14)) (.cse12 (<= 1 cstrnlen_~cp~2.offset)) (.cse5 (or (<= |cstrnlen_#in~maxlen| cstrnlen_~maxlen) (< 0 .cse10))) (.cse6 (or (<= .cse10 0) (<= cstrnlen_~maxlen |cstrnlen_#in~maxlen|))) (.cse7 (= 1 (select |#valid| cstrnlen_~cp~2.base))) (.cse8 (= cstrnlen_~cp~2.offset 0)) (.cse9 (<= 1 .cse14)) (.cse1 (not (= (select |#valid| |cstrnlen_#in~str.base|) 1))) (.cse0 (select |#memory_int| |cstrnlen_#in~str.base|)) (.cse2 (not (= 0 |cstrnlen_#in~str.offset|))) (.cse3 (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (<= |cstrnlen_#in~str.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| |cstrnlen_#in~str.base|)) (= (select (select |#memory_int| |cstrnlen_#in~str.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1))) 0) (<= 1 main_~length1~4))))) (.cse4 (select |#memory_int| cstrnlen_~cp~2.base))) (and (or (or (not (= 0 (select .cse0 |cstrnlen_#in~str.offset|))) .cse1 .cse2 .cse3) (and (= 0 (select .cse4 cstrnlen_~cp~2.offset)) .cse5 .cse6 .cse7 .cse8 .cse9)) (or (< |cstrnlen_#in~maxlen| 1) (and (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| cstrnlen_~cp~2.base)) (= (select (select |#memory_int| cstrnlen_~cp~2.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1))) 0) (<= cstrnlen_~cp~2.offset v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= 1 main_~length1~4))) (<= cstrnlen_~maxlen 1) (<= 1 cstrnlen_~maxlen) .cse7 .cse8) .cse1 .cse2 (< 1 |cstrnlen_#in~maxlen|) (and (<= cstrnlen_~maxlen (* 4294967296 .cse10)) .cse7 .cse11 (< 0 (+ .cse10 1)) .cse12) .cse3) (let ((.cse13 (= 0 (select .cse4 (+ .cse14 (- 1)))))) (or (and .cse13 .cse7 .cse11 .cse12) (and .cse5 .cse13 .cse6 .cse7 .cse8 .cse9) .cse1 (not (= 0 (select .cse0 (+ |cstrnlen_#in~str.offset| (select |#length| |cstrnlen_#in~str.base|) (- 1))))) .cse2 .cse3))))) [2018-01-24 12:54:54,505 INFO L401 ceAbstractionStarter]: For program point cstrnlenErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L404 ceAbstractionStarter]: At program point cstrnlenENTRY(lines 540 547) the Hoare annotation is: true [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point L544''''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 560) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 560) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:54:54,506 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 12:54:54,507 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 12:54:54,507 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 560) no Hoare annotation was computed. [2018-01-24 12:54:54,507 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:54:54,507 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-24 12:54:54,507 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-24 12:54:54,507 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 12:54:54,507 INFO L397 ceAbstractionStarter]: At program point L558'(line 558) the Hoare annotation is: (let ((.cse0 (= 0 |main_#t~malloc6.offset|)) (.cse2 (= 0 main_~nondetString1~4.offset)) (.cse1 (select |#length| main_~nondetString1~4.base)) (.cse3 (= main_~length1~4 (select |#length| |main_#t~malloc6.base|))) (.cse4 (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|)) (.cse5 (= 1 (select |#valid| |main_#t~malloc6.base|))) (.cse6 (= 1 (select |#valid| main_~nondetString1~4.base)))) (or (and (<= 1 main_~n~4) .cse0 (exists ((main_~length1~4 Int)) (and (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~length1~4 main_~nondetString1~4.offset (- 1))) 0) (<= (+ main_~length1~4 main_~nondetString1~4.offset) (select |#length| main_~nondetString1~4.base)) (<= 1 main_~length1~4))) (= main_~length1~4 .cse1) .cse2 .cse3 .cse4 .cse5 (<= main_~n~4 1) .cse6) (and .cse0 .cse2 (= (select (select |#memory_int| main_~nondetString1~4.base) (+ .cse1 (- 1))) 0) (= .cse1 main_~length1~4) .cse3 .cse4 .cse5 .cse6 (<= 1 main_~length1~4)))) [2018-01-24 12:54:54,507 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 12:54:54,515 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,516 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,516 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,516 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,517 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,517 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,517 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:54:54 BoogieIcfgContainer [2018-01-24 12:54:54,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:54:54,551 INFO L168 Benchmark]: Toolchain (without parser) took 7618.50 ms. Allocated memory was 307.8 MB in the beginning and 544.7 MB in the end (delta: 237.0 MB). Free memory was 267.7 MB in the beginning and 367.9 MB in the end (delta: -100.2 MB). Peak memory consumption was 136.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:54:54,552 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:54:54,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.99 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 256.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:54:54,553 INFO L168 Benchmark]: Boogie Preprocessor took 35.23 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:54:54,553 INFO L168 Benchmark]: RCFGBuilder took 209.34 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 239.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:54:54,554 INFO L168 Benchmark]: TraceAbstraction took 7162.74 ms. Allocated memory was 307.8 MB in the beginning and 544.7 MB in the end (delta: 237.0 MB). Free memory was 239.7 MB in the beginning and 367.9 MB in the end (delta: -128.2 MB). Peak memory consumption was 108.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:54:54,555 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.25 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.99 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 256.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.23 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.34 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 239.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7162.74 ms. Allocated memory was 307.8 MB in the beginning and 544.7 MB in the end (delta: 237.0 MB). Free memory was 239.7 MB in the beginning and 367.9 MB in the end (delta: -128.2 MB). Peak memory consumption was 108.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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: 548]: 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 12:54:54,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,565 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,565 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,565 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,565 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,565 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,566 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,566 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,566 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,566 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,567 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,567 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,567 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,567 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,568 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,568 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,568 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,568 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:54:54,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:54:54,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:54:54,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:54:54,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((!(0 == unknown-#memory_int-unknown[str][str]) || !(\valid[str] == 1)) || !(0 == str)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((str <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[str]) && unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && 1 <= main_~length1~4)) || (((((0 == unknown-#memory_int-unknown[cp][cp] && (\old(maxlen) <= maxlen || 0 < maxlen / 4294967296)) && (maxlen / 4294967296 <= 0 || maxlen <= \old(maxlen))) && 1 == \valid[cp]) && cp == 0) && 1 <= unknown-#length-unknown[cp])) && ((((((\old(maxlen) < 1 || (((((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[cp] && unknown-#memory_int-unknown[cp][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && cp <= v_main_~nondetString1~4.offset_BEFORE_CALL_2) && 1 <= main_~length1~4) && maxlen <= 1) && 1 <= maxlen) && 1 == \valid[cp]) && cp == 0)) || !(\valid[str] == 1)) || !(0 == str)) || 1 < \old(maxlen)) || ((((maxlen <= 4294967296 * (maxlen / 4294967296) && 1 == \valid[cp]) && cp + 1 <= unknown-#length-unknown[cp]) && 0 < maxlen / 4294967296 + 1) && 1 <= cp)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((str <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[str]) && unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && 1 <= main_~length1~4))) && ((((((((0 == unknown-#memory_int-unknown[cp][unknown-#length-unknown[cp] + -1] && 1 == \valid[cp]) && cp + 1 <= unknown-#length-unknown[cp]) && 1 <= cp) || ((((((\old(maxlen) <= maxlen || 0 < maxlen / 4294967296) && 0 == unknown-#memory_int-unknown[cp][unknown-#length-unknown[cp] + -1]) && (maxlen / 4294967296 <= 0 || maxlen <= \old(maxlen))) && 1 == \valid[cp]) && cp == 0) && 1 <= unknown-#length-unknown[cp])) || !(\valid[str] == 1)) || !(0 == unknown-#memory_int-unknown[str][str + unknown-#length-unknown[str] + -1])) || !(0 == str)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((str <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[str]) && unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && 1 <= main_~length1~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 5 error locations. SAFE Result, 7.0s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 313 SDslu, 826 SDs, 0 SdLazy, 670 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 195 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 23 NumberOfFragments, 449 HoareAnnotationTreeSize, 13 FomulaSimplifications, 541 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 974 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 416 ConstructedInterpolants, 23 QuantifiedInterpolants, 81100 SizeOfPredicates, 49 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 15/86 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/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-54-54-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-54-54-591.csv Received shutdown request...