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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:46:19,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:46:19,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:46:19,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:46:19,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:46:19,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:46:19,826 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:46:19,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:46:19,829 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:46:19,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:46:19,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:46:19,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:46:19,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:46:19,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:46:19,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:46:19,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:46:19,837 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:46:19,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:46:19,840 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:46:19,841 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:46:19,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:46:19,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:46:19,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:46:19,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:46:19,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:46:19,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:46:19,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:46:19,848 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:46:19,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:46:19,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:46:19,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:46:19,849 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:46:19,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:46:19,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:46:19,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:46:19,860 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:46:19,860 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:46:19,860 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:46:19,860 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:46:19,860 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:46:19,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:46:19,861 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:46:19,861 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:46:19,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:46:19,862 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:46:19,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:46:19,862 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:46:19,862 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:46:19,862 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:46:19,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:46:19,863 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:46:19,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:46:19,863 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:46:19,863 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:46:19,864 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:46:19,864 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:46:19,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:46:19,864 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:46:19,864 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:46:19,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:46:19,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:46:19,865 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:46:19,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:46:19,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:46:19,866 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:46:19,866 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:46:19,867 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:46:19,867 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:46:19,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:46:19,910 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:46:19,913 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:46:19,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:46:19,914 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:46:19,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:46:20,059 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:46:20,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:46:20,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:46:20,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:46:20,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:46:20,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577bb5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20, skipping insertion in model container [2018-01-24 16:46:20,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:46:20,121 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:46:20,229 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:46:20,243 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:46:20,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20 WrapperNode [2018-01-24 16:46:20,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:46:20,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:46:20,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:46:20,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:46:20,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (1/1) ... [2018-01-24 16:46:20,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:46:20,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:46:20,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:46:20,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:46:20,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (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 16:46:20,327 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:46:20,328 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:46:20,328 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-01-24 16:46:20,328 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:46:20,328 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:46:20,328 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:46:20,328 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:46:20,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:46:20,329 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:46:20,329 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:46:20,329 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-01-24 16:46:20,329 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:46:20,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:46:20,330 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:46:20,502 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:46:20,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:46:20 BoogieIcfgContainer [2018-01-24 16:46:20,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:46:20,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:46:20,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:46:20,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:46:20,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:46:20" (1/3) ... [2018-01-24 16:46:20,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6533a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:46:20, skipping insertion in model container [2018-01-24 16:46:20,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:46:20" (2/3) ... [2018-01-24 16:46:20,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6533a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:46:20, skipping insertion in model container [2018-01-24 16:46:20,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:46:20" (3/3) ... [2018-01-24 16:46:20,508 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:46:20,514 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:46:20,519 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 16:46:20,554 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:46:20,554 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:46:20,554 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:46:20,554 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:46:20,555 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:46:20,555 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:46:20,555 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:46:20,555 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:46:20,556 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:46:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 16:46:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:46:20,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:20,584 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:20,584 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979584, now seen corresponding path program 1 times [2018-01-24 16:46:20,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:20,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:20,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:20,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:20,635 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:20,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:20,737 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 16:46:20,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:20,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:46:20,740 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:20,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:46:20,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:46:20,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:46:20,760 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-01-24 16:46:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:20,839 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-24 16:46:20,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:46:20,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 16:46:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:20,852 INFO L225 Difference]: With dead ends: 54 [2018-01-24 16:46:20,853 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 16:46:20,917 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:46:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 16:46:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 16:46:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 16:46:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 16:46:20,947 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 16:46:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:20,948 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 16:46:20,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:46:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 16:46:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:46:20,949 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:20,949 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:20,949 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226348, now seen corresponding path program 1 times [2018-01-24 16:46:20,949 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:20,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:20,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:20,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:20,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:20,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:21,022 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 16:46:21,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:21,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:46:21,023 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:21,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:46:21,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:46:21,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:46:21,025 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 16:46:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:21,107 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 16:46:21,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:46:21,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:46:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:21,108 INFO L225 Difference]: With dead ends: 37 [2018-01-24 16:46:21,108 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 16:46:21,109 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 16:46:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 16:46:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 16:46:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:46:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:46:21,115 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 16:46:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:21,116 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:46:21,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:46:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:46:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:46:21,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:21,117 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:21,117 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226347, now seen corresponding path program 1 times [2018-01-24 16:46:21,117 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:21,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:21,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,118 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:21,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:21,239 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 16:46:21,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:21,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:46:21,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:21,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:46:21,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:46:21,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:46:21,240 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 16:46:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:21,330 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 16:46:21,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:46:21,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:46:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:21,332 INFO L225 Difference]: With dead ends: 36 [2018-01-24 16:46:21,332 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 16:46:21,333 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 16:46:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 16:46:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 16:46:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 16:46:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 16:46:21,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 16:46:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:21,339 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 16:46:21,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:46:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 16:46:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:46:21,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:21,340 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:21,340 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633306, now seen corresponding path program 1 times [2018-01-24 16:46:21,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:21,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:21,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:21,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:21,406 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 16:46:21,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:21,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:46:21,406 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:21,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:46:21,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:46:21,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:46:21,407 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 16:46:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:21,481 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 16:46:21,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:46:21,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:46:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:21,483 INFO L225 Difference]: With dead ends: 35 [2018-01-24 16:46:21,483 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 16:46:21,483 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 16:46:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 16:46:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 16:46:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 16:46:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 16:46:21,489 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-24 16:46:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:21,490 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 16:46:21,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:46:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 16:46:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:46:21,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:21,491 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:21,491 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633307, now seen corresponding path program 1 times [2018-01-24 16:46:21,491 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:21,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:21,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,492 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:21,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:21,618 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 16:46:21,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:21,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:46:21,618 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:21,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:46:21,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:46:21,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:46:21,619 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-24 16:46:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:21,712 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 16:46:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:46:21,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 16:46:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:21,716 INFO L225 Difference]: With dead ends: 45 [2018-01-24 16:46:21,716 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 16:46:21,717 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:46:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 16:46:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-24 16:46:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:46:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:46:21,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-24 16:46:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:21,724 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:46:21,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:46:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:46:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:46:21,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:21,725 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:21,725 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -429040459, now seen corresponding path program 1 times [2018-01-24 16:46:21,726 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:21,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:21,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:21,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:21,821 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 16:46:21,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:21,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:46:21,821 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:21,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:46:21,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:46:21,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:46:21,822 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-24 16:46:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:21,919 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 16:46:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:46:21,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 16:46:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:21,920 INFO L225 Difference]: With dead ends: 36 [2018-01-24 16:46:21,920 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 16:46:21,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:46:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 16:46:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 16:46:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 16:46:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 16:46:21,926 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-24 16:46:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:21,927 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 16:46:21,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:46:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 16:46:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:46:21,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:21,928 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:21,928 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash -429040458, now seen corresponding path program 1 times [2018-01-24 16:46:21,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:21,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:21,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:21,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:21,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:22,038 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 16:46:22,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:22,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:46:22,038 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:22,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:46:22,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:46:22,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:46:22,039 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-24 16:46:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:22,160 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 16:46:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:46:22,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 16:46:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:22,161 INFO L225 Difference]: With dead ends: 42 [2018-01-24 16:46:22,162 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 16:46:22,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:46:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 16:46:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-24 16:46:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:46:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:46:22,168 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-24 16:46:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:22,169 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:46:22,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:46:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:46:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:46:22,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:22,170 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:22,170 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 39867865, now seen corresponding path program 1 times [2018-01-24 16:46:22,170 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:22,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:22,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:22,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:22,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:22,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:22,359 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 16:46:22,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:22,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 16:46:22,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:22,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:46:22,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:46:22,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:46:22,361 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-01-24 16:46:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:22,635 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-24 16:46:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 16:46:22,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-24 16:46:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:22,636 INFO L225 Difference]: With dead ends: 91 [2018-01-24 16:46:22,636 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 16:46:22,637 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:46:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 16:46:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-01-24 16:46:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:46:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 16:46:22,651 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-01-24 16:46:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:22,652 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 16:46:22,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:46:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 16:46:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:46:22,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:22,653 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:22,654 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1548480037, now seen corresponding path program 1 times [2018-01-24 16:46:22,654 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:22,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:22,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:22,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:22,655 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:22,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:22,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:22,833 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:46:22,834 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 16:46:22,835 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [21], [22], [23], [24], [25], [26], [37], [41], [42], [44], [45], [52], [54], [60], [61], [62], [64] [2018-01-24 16:46:22,878 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:46:22,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:46:23,086 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:46:23,087 INFO L268 AbstractInterpreter]: Visited 22 different actions 32 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-24 16:46:23,097 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:46:23,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:23,097 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 16:46:23,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:23,109 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:23,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:23,179 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 16:46:23,182 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 16:46:23,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,196 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 16:46:23,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:46:23,282 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 16:46:23,294 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 16:46:23,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:23,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:23,318 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 16:46:23,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 16:46:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:23,393 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:23,523 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 16:46:23,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,529 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 16:46:23,538 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 16:46:23,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,544 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 16:46:23,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 16:46:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:23,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:23,577 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:46:23,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:23,584 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:23,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:23,631 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 16:46:23,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:46:23,684 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 16:46:23,686 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 16:46:23,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:46:23,785 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 16:46:23,802 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 16 [2018-01-24 16:46:23,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:23,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:23,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:23,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 16:46:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:23,868 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:23,921 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 16:46:23,929 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 16:46:23,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:23,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:46:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:23,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:46:23,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 32 [2018-01-24 16:46:23,991 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:46:23,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 16:46:23,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 16:46:23,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 16:46:23,992 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 16 states. [2018-01-24 16:46:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:24,370 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-24 16:46:24,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:46:24,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-24 16:46:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:24,372 INFO L225 Difference]: With dead ends: 67 [2018-01-24 16:46:24,372 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 16:46:24,373 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 16:46:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 16:46:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 16:46:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 16:46:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 16:46:24,383 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-01-24 16:46:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:24,384 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 16:46:24,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 16:46:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 16:46:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:46:24,385 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:24,385 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, 1, 1] [2018-01-24 16:46:24,385 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash -758240906, now seen corresponding path program 1 times [2018-01-24 16:46:24,386 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:24,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:24,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:24,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:24,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:24,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:24,604 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 16:46:24,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:24,604 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:46:24,604 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 16:46:24,605 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [21], [22], [23], [24], [25], [26], [37], [41], [42], [45], [47], [52], [54], [60], [61], [62], [64] [2018-01-24 16:46:24,606 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:46:24,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:46:24,705 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:46:24,705 INFO L268 AbstractInterpreter]: Visited 22 different actions 32 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-24 16:46:24,713 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:46:24,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:24,713 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:46:24,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:24,728 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:24,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:24,770 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 16:46:24,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:24,839 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 16:46:24,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:24,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:24,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 16:46:24,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:24,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:24,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:24,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:24,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:24,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:24,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:24,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:24,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 16:46:25,058 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 16:46:25,059 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:25,362 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 6 treesize of output 1 [2018-01-24 16:46:25,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,369 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:46:25,379 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 12 treesize of output 3 [2018-01-24 16:46:25,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,381 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:46:25,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:46:25,427 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 16:46:25,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:25,446 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:46:25,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:25,449 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:46:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:25,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:25,490 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 16:46:25,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,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 6 treesize of output 5 [2018-01-24 16:46:25,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 16:46:25,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:25,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:25,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:25,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:46:25,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:25,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-24 16:46:25,941 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 16:46:25,942 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:26,215 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 6 treesize of output 1 [2018-01-24 16:46:26,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:26,219 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:46:26,231 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 12 treesize of output 3 [2018-01-24 16:46:26,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:26,240 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:46:26,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:26,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:26,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:26,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:46:26,252 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 16:46:26,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:46:26,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 10, 11] total 42 [2018-01-24 16:46:26,254 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:46:26,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 16:46:26,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 16:46:26,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 16:46:26,255 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 22 states. [2018-01-24 16:46:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:26,807 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-24 16:46:26,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:46:26,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-24 16:46:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:26,809 INFO L225 Difference]: With dead ends: 65 [2018-01-24 16:46:26,809 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 16:46:26,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 16:46:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 16:46:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-24 16:46:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:46:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-24 16:46:26,819 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 24 [2018-01-24 16:46:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:26,819 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-24 16:46:26,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 16:46:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-24 16:46:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:46:26,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:26,820 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:26,821 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:26,821 INFO L82 PathProgramCache]: Analyzing trace with hash 67945113, now seen corresponding path program 2 times [2018-01-24 16:46:26,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:26,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:26,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:46:26,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:26,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:26,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:27,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:27,117 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:46:27,117 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:46:27,118 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:46:27,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:27,118 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:46:27,124 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:46:27,124 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:46:27,136 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:46:27,141 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:46:27,143 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:46:27,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:27,149 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 16:46:27,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:46:27,155 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 16:46:27,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:27,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:27,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:27,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:46:27,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:46:27,208 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 16:46:27,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 16:46:27,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 16:46:27,303 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 16:46:27,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:46:27,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-24 16:46:27,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:46:27,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:46:27,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:27,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:27,398 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 16:46:27,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 16:46:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:27,442 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:27,749 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-01-24 16:46:27,772 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 16:46:27,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,791 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 16:46:27,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:46:27,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 16:46:27,800 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 9 treesize of output 1 [2018-01-24 16:46:27,801 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:46:27,886 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-01-24 16:46:27,909 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 16:46:27,909 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 16:46:27,928 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 9 treesize of output 1 [2018-01-24 16:46:27,928 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,930 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,932 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 16:46:27,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:46:27,934 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,938 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:27,951 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:46:28,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 16:46:28,009 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-01-24 16:46:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:28,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:46:28,197 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:46:28,200 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:46:28,200 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:46:28,212 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:46:28,230 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:46:28,264 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:46:28,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:46:28,271 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 16:46:28,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:46:28,276 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 16:46:28,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:28,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:46:28,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:46:28,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:46:28,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:46:28,317 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 16:46:28,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-24 16:46:28,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 16:46:28,398 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 16:46:28,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2018-01-24 16:46:28,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:46:28,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:46:28,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:46:28,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:46:28,539 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 16:46:28,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 16:46:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:28,542 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:46:28,768 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:46:28,780 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 16:46:28,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,793 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 16:46:28,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:46:28,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 16:46:28,800 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 9 treesize of output 1 [2018-01-24 16:46:28,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:46:28,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:46:28,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:46:28,831 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:125 [2018-01-24 16:46:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:46:29,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:46:29,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13, 13, 13] total 44 [2018-01-24 16:46:29,028 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:46:29,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 16:46:29,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 16:46:29,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 16:46:29,029 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 20 states. [2018-01-24 16:46:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:29,763 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 16:46:29,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:46:29,764 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-24 16:46:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:29,765 INFO L225 Difference]: With dead ends: 64 [2018-01-24 16:46:29,765 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 16:46:29,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=349, Invalid=2843, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 16:46:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 16:46:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-01-24 16:46:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 16:46:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 16:46:29,774 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 28 [2018-01-24 16:46:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:29,774 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 16:46:29,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 16:46:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 16:46:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:46:29,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:46:29,775 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, 1, 1, 1, 1, 1, 1] [2018-01-24 16:46:29,776 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 16:46:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1163981862, now seen corresponding path program 1 times [2018-01-24 16:46:29,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:46:29,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:29,777 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:46:29,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:46:29,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:46:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:46:29,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:46:29,868 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 16:46:29,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:46:29,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:46:29,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:46:29,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:46:29,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:46:29,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:46:29,906 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 6 states. [2018-01-24 16:46:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:46:29,959 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 16:46:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:46:29,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 16:46:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:46:29,960 INFO L225 Difference]: With dead ends: 47 [2018-01-24 16:46:29,960 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:46:29,960 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:46:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:46:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:46:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:46:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:46:29,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 16:46:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:46:29,961 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:46:29,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:46:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:46:29,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:46:29,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:46:29,999 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:46:30,267 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 75 DAG size of output 54 [2018-01-24 16:46:30,394 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-01-24 16:46:30,783 WARN L146 SmtUtils]: Spent 387ms on a formula simplification. DAG size of input: 135 DAG size of output 103 [2018-01-24 16:46:30,786 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,786 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:46:30,786 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,786 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 16:46:30,786 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,786 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L551'(lines 551 553) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 545 560) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 545 560) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 16:46:30,787 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 545 560) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 545 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L397 ceAbstractionStarter]: At program point L557'(line 557) the Hoare annotation is: (let ((.cse1 (select |#length| |main_#t~malloc7.base|)) (.cse0 (select |#length| main_~nondetString~4.base))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= .cse0 main_~length2~4) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ main_~nondetString~4.offset .cse0 (- 1)))) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,788 INFO L397 ceAbstractionStarter]: At program point cstpcpyENTRY(lines 540 544) the Hoare annotation is: (let ((.cse11 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse2 (select |old(#memory_int)| |cstpcpy_#in~from.base|)) (.cse10 (+ .cse11 |cstpcpy_#in~from.offset| (- 1)))) (let ((.cse0 (not (= 0 |cstpcpy_#in~from.offset|))) (.cse1 (not (= (select |#valid| |cstpcpy_#in~to.base|) 1))) (.cse3 (not (= 1 (select |#valid| |cstpcpy_#in~from.base|)))) (.cse4 (select |#memory_int| |cstpcpy_#in~from.base|)) (.cse5 (not (= (select .cse2 .cse10) 0))) (.cse6 (not (= |cstpcpy_#in~to.offset| 0))) (.cse7 (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|)) (.cse8 (not (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0) (<= |cstpcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= 1 main_~length2~4) (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| |cstpcpy_#in~from.base|)))))) (.cse9 (< (select |#length| |cstpcpy_#in~to.base|) .cse11))) (and (or .cse0 .cse1 (not (= (select .cse2 |cstpcpy_#in~from.offset|) 0)) .cse3 (= 0 (select .cse4 |cstpcpy_#in~from.offset|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse3 (= 0 (select .cse4 .cse10)) .cse5 .cse6 .cse7 .cse8 .cse9))))) [2018-01-24 16:46:30,789 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,789 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-24 16:46:30,789 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:46:30,789 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-24 16:46:30,789 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-24 16:46:30,789 INFO L401 ceAbstractionStarter]: For program point cstpcpyEXIT(lines 540 544) no Hoare annotation was computed. [2018-01-24 16:46:30,789 INFO L401 ceAbstractionStarter]: For program point cstpcpyFINAL(lines 540 544) no Hoare annotation was computed. [2018-01-24 16:46:30,789 INFO L397 ceAbstractionStarter]: At program point L542'''''(line 542) the Hoare annotation is: (let ((.cse2 (select |old(#memory_int)| |cstpcpy_#in~from.base|)) (.cse19 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse0 (not (= 0 |cstpcpy_#in~from.offset|))) (.cse1 (not (= (select |#valid| |cstpcpy_#in~to.base|) 1))) (.cse3 (not (= 1 (select |#valid| |cstpcpy_#in~from.base|)))) (.cse4 (not (= (select .cse2 (+ .cse19 |cstpcpy_#in~from.offset| (- 1))) 0))) (.cse5 (not (= |cstpcpy_#in~to.offset| 0))) (.cse7 (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|)) (.cse6 (= cstpcpy_~from.offset 0)) (.cse8 (not (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0) (<= |cstpcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= 1 main_~length2~4) (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| |cstpcpy_#in~from.base|)))))) (.cse9 (< (select |#length| |cstpcpy_#in~to.base|) .cse19))) (and (or .cse0 .cse1 (not (= (select .cse2 |cstpcpy_#in~from.offset|) 0)) .cse3 .cse4 .cse5 (and (= 0 (select (select |#memory_int| cstpcpy_~from.base) cstpcpy_~from.offset)) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|)) .cse6) .cse7 .cse8 .cse9) (let ((.cse15 (select |#length| cstpcpy_~from.base)) (.cse16 (select |#length| cstpcpy_~to.base))) (let ((.cse10 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| cstpcpy_~from.base) (+ (select |#length| cstpcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6) (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_6 1) cstpcpy_~from.offset)))) (.cse11 (= 1 (select |#valid| cstpcpy_~to.base))) (.cse12 (= 1 (select |#valid| cstpcpy_~from.base))) (.cse13 (not (= cstpcpy_~from.base cstpcpy_~to.base))) (.cse18 (<= .cse15 .cse16)) (.cse14 (<= (+ cstpcpy_~from.offset 1) .cse15)) (.cse17 (<= 1 cstpcpy_~to.offset))) (or .cse0 (and .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ .cse15 cstpcpy_~to.offset) (+ .cse16 cstpcpy_~from.offset)) .cse17 (<= 2 cstpcpy_~from.offset)) .cse1 .cse3 .cse4 .cse5 .cse7 (and (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| cstpcpy_~from.base) (+ (select |#length| cstpcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 cstpcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6))) (= cstpcpy_~to.offset 0) (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 |cstpcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) (+ (select |#length| |cstpcpy_#in~from.base|) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1)))))) .cse11 .cse12 .cse13 (<= 1 .cse15) .cse18 .cse6) .cse8 .cse9 (and .cse10 .cse11 (<= cstpcpy_~to.offset 1) .cse12 .cse13 .cse18 .cse14 .cse17))))))) [2018-01-24 16:46:30,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,828 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,828 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,828 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,832 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,840 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:46:30 BoogieIcfgContainer [2018-01-24 16:46:30,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:46:30,844 INFO L168 Benchmark]: Toolchain (without parser) took 10784.07 ms. Allocated memory was 297.3 MB in the beginning and 581.4 MB in the end (delta: 284.2 MB). Free memory was 257.3 MB in the beginning and 403.5 MB in the end (delta: -146.1 MB). Peak memory consumption was 227.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:46:30,844 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:46:30,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.01 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 246.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:46:30,845 INFO L168 Benchmark]: Boogie Preprocessor took 33.79 ms. Allocated memory is still 297.3 MB. Free memory was 246.1 MB in the beginning and 245.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-24 16:46:30,845 INFO L168 Benchmark]: RCFGBuilder took 219.24 ms. Allocated memory is still 297.3 MB. Free memory was 245.1 MB in the beginning and 228.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:46:30,845 INFO L168 Benchmark]: TraceAbstraction took 10339.40 ms. Allocated memory was 297.3 MB in the beginning and 581.4 MB in the end (delta: 284.2 MB). Free memory was 228.2 MB in the beginning and 403.5 MB in the end (delta: -175.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:46:30,847 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.11 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 184.01 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 246.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.79 ms. Allocated memory is still 297.3 MB. Free memory was 246.1 MB in the beginning and 245.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 219.24 ms. Allocated memory is still 297.3 MB. Free memory was 245.1 MB in the beginning and 228.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10339.40 ms. Allocated memory was 297.3 MB in the beginning and 581.4 MB in the end (delta: 284.2 MB). Free memory was 228.2 MB in the beginning and 403.5 MB in the end (delta: -175.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 175 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.582976 RENAME_VARIABLES(MILLISECONDS) : 0.442338 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.534126 PROJECTAWAY(MILLISECONDS) : 0.340633 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001083 DISJOIN(MILLISECONDS) : 0.510349 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.485550 ADD_EQUALITY(MILLISECONDS) : 0.020614 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011308 #CONJOIN_DISJUNCTIVE : 57 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 101 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 56 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 178 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.658420 RENAME_VARIABLES(MILLISECONDS) : 0.284289 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.229101 PROJECTAWAY(MILLISECONDS) : 0.034771 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001358 DISJOIN(MILLISECONDS) : 0.603979 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.316952 ADD_EQUALITY(MILLISECONDS) : 0.021874 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.039622 #CONJOIN_DISJUNCTIVE : 57 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 101 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 56 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 542]: Loop Invariant [2018-01-24 16:46:30,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,859 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,859 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,859 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,861 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,863 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,863 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,863 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,866 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,867 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,871 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:46:30,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:46:30,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:46:30,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:46:30,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:46:30,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((!(0 == from) || !(\valid[to] == 1)) || !(\old(unknown-#memory_int-unknown)[from][from] == 0)) || !(1 == \valid[from])) || !(\old(unknown-#memory_int-unknown)[from][unknown-#length-unknown[from] + from + -1] == 0)) || !(to == 0)) || ((0 == unknown-#memory_int-unknown[from][from] && 0 == unknown-#memory_int-unknown[from][from]) && from == 0)) || from == to) || !(\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((\old(unknown-#memory_int-unknown)[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0 && from <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 1 <= main_~length2~4) && main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from])) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) && ((((((((((!(0 == from) || ((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 + 1 <= from) && 1 == \valid[to]) && 1 == \valid[from]) && !(from == to)) && from + 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] + to <= unknown-#length-unknown[to] + from) && 1 <= to) && 2 <= from)) || !(\valid[to] == 1)) || !(1 == \valid[from])) || !(\old(unknown-#memory_int-unknown)[from][unknown-#length-unknown[from] + from + -1] == 0)) || !(to == 0)) || from == to) || (((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && to == 0) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1])) && 1 == \valid[to]) && 1 == \valid[from]) && !(from == to)) && 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && from == 0)) || !(\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((\old(unknown-#memory_int-unknown)[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0 && from <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 1 <= main_~length2~4) && main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from])) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) || ((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 + 1 <= from) && 1 == \valid[to]) && to <= 1) && 1 == \valid[from]) && !(from == to)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && from + 1 <= unknown-#length-unknown[from]) && 1 <= to)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 10.2s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 491 SDslu, 1428 SDs, 0 SdLazy, 1378 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 211 SyntacticMatches, 20 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 649 HoareAnnotationTreeSize, 9 FomulaSimplifications, 293 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 701 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 515 ConstructedInterpolants, 36 QuantifiedInterpolants, 126882 SizeOfPredicates, 81 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 2/72 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_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-46-30-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-46-30-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-46-30-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-46-30-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-46-30-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-46-30-886.csv Received shutdown request...