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_smtcomp.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-25 05:26:07,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:26:07,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:26:07,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:26:07,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:26:07,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:26:07,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:26:07,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:26:07,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:26:07,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:26:07,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:26:07,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:26:07,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:26:08,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:26:08,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:26:08,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:26:08,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:26:08,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:26:08,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:26:08,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:26:08,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:26:08,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:26:08,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:26:08,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:26:08,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:26:08,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:26:08,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:26:08,018 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:26:08,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:26:08,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:26:08,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:26:08,020 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_smtcomp.epf [2018-01-25 05:26:08,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:26:08,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:26:08,030 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:26:08,030 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:26:08,030 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:26:08,030 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:26:08,030 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:26:08,030 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:26:08,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:26:08,031 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:26:08,031 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:26:08,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:26:08,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:26:08,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:26:08,032 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:26:08,032 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:26:08,032 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:26:08,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:26:08,032 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:26:08,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:26:08,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:26:08,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:26:08,033 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:26:08,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:26:08,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:26:08,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:26:08,034 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:26:08,035 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:26:08,035 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:26:08,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:26:08,081 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:26:08,085 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:26:08,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:26:08,086 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:26:08,087 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-25 05:26:08,245 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:26:08,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:26:08,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:26:08,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:26:08,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:26:08,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08, skipping insertion in model container [2018-01-25 05:26:08,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,275 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:26:08,313 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:26:08,437 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:26:08,455 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:26:08,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08 WrapperNode [2018-01-25 05:26:08,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:26:08,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:26:08,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:26:08,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:26:08,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (1/1) ... [2018-01-25 05:26:08,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:26:08,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:26:08,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:26:08,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:26:08,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (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-25 05:26:08,553 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:26:08,553 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:26:08,553 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-01-25 05:26:08,553 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:26:08,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:26:08,759 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:26:08,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:26:08 BoogieIcfgContainer [2018-01-25 05:26:08,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:26:08,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:26:08,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:26:08,762 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:26:08,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:26:08" (1/3) ... [2018-01-25 05:26:08,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b12b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:26:08, skipping insertion in model container [2018-01-25 05:26:08,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:26:08" (2/3) ... [2018-01-25 05:26:08,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b12b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:26:08, skipping insertion in model container [2018-01-25 05:26:08,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:26:08" (3/3) ... [2018-01-25 05:26:08,764 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:26:08,771 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:26:08,777 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 05:26:08,822 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:26:08,822 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:26:08,822 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:26:08,822 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:26:08,822 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:26:08,822 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:26:08,823 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:26:08,823 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:26:08,823 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:26:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-25 05:26:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:26:08,846 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:08,847 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:26:08,847 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979584, now seen corresponding path program 1 times [2018-01-25 05:26:08,855 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:08,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:08,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:08,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:08,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:08,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:09,014 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-25 05:26:09,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:09,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:26:09,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:09,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:26:09,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:26:09,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:26:09,038 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-01-25 05:26:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:09,197 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-25 05:26:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:26:09,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-25 05:26:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:09,207 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:26:09,207 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 05:26:09,209 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-25 05:26:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 05:26:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-25 05:26:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 05:26:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 05:26:09,241 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-25 05:26:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:09,242 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 05:26:09,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:26:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 05:26:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:26:09,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:09,243 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:26:09,243 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226348, now seen corresponding path program 1 times [2018-01-25 05:26:09,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:09,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:09,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,246 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:09,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:09,317 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-25 05:26:09,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:09,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:26:09,317 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:09,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:26:09,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:26:09,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:26:09,320 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-25 05:26:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:09,396 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 05:26:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:26:09,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:26:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:09,397 INFO L225 Difference]: With dead ends: 37 [2018-01-25 05:26:09,397 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 05:26:09,398 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-25 05:26:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 05:26:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 05:26:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:26:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:26:09,404 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-25 05:26:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:09,404 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:26:09,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:26:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:26:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:26:09,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:09,405 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:26:09,405 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226347, now seen corresponding path program 1 times [2018-01-25 05:26:09,405 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:09,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:09,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,406 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:09,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:09,511 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-25 05:26:09,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:09,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:26:09,512 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:09,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:26:09,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:26:09,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:26:09,513 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-25 05:26:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:09,615 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-25 05:26:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:26:09,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:26:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:09,616 INFO L225 Difference]: With dead ends: 36 [2018-01-25 05:26:09,616 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:26:09,617 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-25 05:26:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:26:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 05:26:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:26:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-25 05:26:09,623 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-25 05:26:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:09,623 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-25 05:26:09,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:26:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-25 05:26:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:26:09,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:09,624 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-25 05:26:09,624 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633306, now seen corresponding path program 1 times [2018-01-25 05:26:09,625 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:09,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:09,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,626 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:09,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:09,704 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-25 05:26:09,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:09,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:26:09,704 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:09,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:26:09,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:26:09,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:26:09,705 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-25 05:26:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:09,769 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-25 05:26:09,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:26:09,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:26:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:09,771 INFO L225 Difference]: With dead ends: 35 [2018-01-25 05:26:09,771 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 05:26:09,771 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-25 05:26:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 05:26:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-25 05:26:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 05:26:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-25 05:26:09,778 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-25 05:26:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:09,778 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-25 05:26:09,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:26:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-25 05:26:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:26:09,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:09,779 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-25 05:26:09,780 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633307, now seen corresponding path program 1 times [2018-01-25 05:26:09,780 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:09,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:09,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:09,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:09,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:09,902 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-25 05:26:09,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:09,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:26:09,902 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:09,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:26:09,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:26:09,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:26:09,903 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-25 05:26:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:09,992 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-25 05:26:09,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:26:09,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 05:26:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:09,995 INFO L225 Difference]: With dead ends: 45 [2018-01-25 05:26:09,996 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 05:26:09,996 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-25 05:26:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 05:26:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-25 05:26:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:26:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:26:10,003 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-25 05:26:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:10,004 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:26:10,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:26:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:26:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:26:10,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:10,005 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-25 05:26:10,005 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -429040459, now seen corresponding path program 1 times [2018-01-25 05:26:10,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:10,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:10,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:10,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:10,123 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-25 05:26:10,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:10,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:26:10,123 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:10,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:26:10,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:26:10,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:26:10,124 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-25 05:26:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:10,214 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-25 05:26:10,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:26:10,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:26:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:10,216 INFO L225 Difference]: With dead ends: 36 [2018-01-25 05:26:10,216 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:26:10,216 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-25 05:26:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:26:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 05:26:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:26:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-25 05:26:10,223 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-25 05:26:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:10,224 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-25 05:26:10,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:26:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-25 05:26:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:26:10,225 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:10,225 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-25 05:26:10,225 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash -429040458, now seen corresponding path program 1 times [2018-01-25 05:26:10,226 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:10,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:10,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,227 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:10,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:10,342 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-25 05:26:10,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:10,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:26:10,343 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:10,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:26:10,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:26:10,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:26:10,344 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-25 05:26:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:10,473 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-25 05:26:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:26:10,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:26:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:10,474 INFO L225 Difference]: With dead ends: 42 [2018-01-25 05:26:10,474 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:26:10,474 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-25 05:26:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:26:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-25 05:26:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:26:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:26:10,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-25 05:26:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:10,479 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:26:10,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:26:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:26:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:26:10,480 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:10,480 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-25 05:26:10,480 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash 39867865, now seen corresponding path program 1 times [2018-01-25 05:26:10,481 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:10,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:10,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,482 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:10,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:10,694 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-25 05:26:10,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:10,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:26:10,695 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:10,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:26:10,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:26:10,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:26:10,696 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-01-25 05:26:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:10,881 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-25 05:26:10,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:26:10,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-25 05:26:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:10,882 INFO L225 Difference]: With dead ends: 91 [2018-01-25 05:26:10,882 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:26:10,883 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-25 05:26:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:26:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-01-25 05:26:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:26:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-25 05:26:10,898 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-01-25 05:26:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:10,899 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-25 05:26:10,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:26:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-25 05:26:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:26:10,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:10,900 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-25 05:26:10,900 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1548480037, now seen corresponding path program 1 times [2018-01-25 05:26:10,900 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:10,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:10,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:10,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:10,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:11,146 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-25 05:26:11,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:11,147 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:26:11,148 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 05:26:11,149 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-25 05:26:11,189 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:26:11,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:26:14,062 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:26:14,063 INFO L268 AbstractInterpreter]: Visited 22 different actions 40 times. Merged at 6 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 05:26:14,075 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:26:14,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:14,075 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-25 05:26:14,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:14,089 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:26:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:14,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:26:14,160 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-25 05:26:14,164 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-25 05:26:14,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:14,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:14,198 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-25 05:26:14,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:26:14,377 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-25 05:26:14,418 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-25 05:26:14,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:26:14,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:26:14,485 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-25 05:26:14,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 05:26:14,752 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-25 05:26:14,752 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:26:15,253 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-25 05:26:15,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,274 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-25 05:26:15,317 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-25 05:26:15,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,328 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-25 05:26:15,328 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 05:26:15,340 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-25 05:26:15,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:15,377 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-25 05:26:15,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:15,387 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:26:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:15,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:26:15,452 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-25 05:26:15,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:26:15,571 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-25 05:26:15,574 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-25 05:26:15,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:15,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:26:15,734 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-25 05:26:15,743 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-25 05:26:15,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:26:15,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:26:15,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:26:15,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-25 05:26:15,939 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-25 05:26:15,940 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:26:16,041 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-25 05:26:16,056 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-25 05:26:16,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:16,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:16,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:16,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:26:16,168 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-25 05:26:16,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:26:16,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 32 [2018-01-25 05:26:16,170 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:26:16,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:26:16,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:26:16,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 05:26:16,173 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 16 states. [2018-01-25 05:26:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:16,626 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-25 05:26:16,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:26:16,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-25 05:26:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:16,628 INFO L225 Difference]: With dead ends: 67 [2018-01-25 05:26:16,628 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 05:26:16,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 05:26:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 05:26:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-25 05:26:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:26:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-25 05:26:16,640 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-01-25 05:26:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:16,640 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-25 05:26:16,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:26:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-25 05:26:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:26:16,641 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:16,642 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-25 05:26:16,642 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash -758240906, now seen corresponding path program 1 times [2018-01-25 05:26:16,642 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:16,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:16,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:16,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:16,643 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:16,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:16,826 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-25 05:26:16,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:16,826 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:26:16,826 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:26:16,826 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-25 05:26:16,828 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:26:16,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:26:19,484 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:26:19,484 INFO L268 AbstractInterpreter]: Visited 22 different actions 38 times. Merged at 6 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 05:26:19,490 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:26:19,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:19,490 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 05:26:19,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:19,499 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:26:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:19,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:26:19,532 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-25 05:26:19,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:19,560 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-25 05:26:19,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:19,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-25 05:26:19,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-25 05:26:19,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:19,628 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-25 05:26:19,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:19,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:19,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:19,643 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-25 05:26:19,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:19,651 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-25 05:26:19,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-25 05:26:20,042 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-25 05:26:20,043 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:26:20,458 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-25 05:26:20,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,462 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-25 05:26:20,473 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-25 05:26:20,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,475 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:26:20,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,483 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-25 05:26:20,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-25 05:26:20,513 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-25 05:26:20,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:20,535 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-25 05:26:20,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:20,538 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:26:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:20,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:26:20,585 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-25 05:26:20,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,614 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-25 05:26:20,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,622 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-25 05:26:20,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-25 05:26:20,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:20,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:20,642 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-25 05:26:20,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,663 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-25 05:26:20,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:20,673 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-25 05:26:20,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-25 05:26:21,015 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-25 05:26:21,016 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:26:21,290 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-25 05:26:21,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:21,296 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-25 05:26:21,313 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-25 05:26:21,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:21,328 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:26:21,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:21,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:21,354 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-25 05:26:21,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-25 05:26:21,359 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-25 05:26:21,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:26:21,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 10, 11] total 42 [2018-01-25 05:26:21,360 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:26:21,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:26:21,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:26:21,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 05:26:21,361 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 22 states. [2018-01-25 05:26:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:21,942 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-25 05:26:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:26:21,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-25 05:26:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:21,944 INFO L225 Difference]: With dead ends: 65 [2018-01-25 05:26:21,944 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 05:26:21,944 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-01-25 05:26:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 05:26:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-25 05:26:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:26:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-25 05:26:21,951 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 24 [2018-01-25 05:26:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:21,952 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-25 05:26:21,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:26:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-25 05:26:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:26:21,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:21,953 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-25 05:26:21,953 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 67945113, now seen corresponding path program 2 times [2018-01-25 05:26:21,954 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:21,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:21,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:26:21,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:21,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:21,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:22,237 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-25 05:26:22,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:22,238 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:26:22,238 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:26:22,238 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:26:22,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:22,238 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-25 05:26:22,244 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:26:22,244 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:26:22,254 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:26:22,259 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:26:22,261 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:26:22,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:26:22,266 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-25 05:26:22,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:26:22,272 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-25 05:26:22,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:22,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:22,280 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-25 05:26:22,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:26:22,314 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-25 05:26:22,316 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-25 05:26:22,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-25 05:26:22,417 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-25 05:26:22,421 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-25 05:26:22,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,440 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-25 05:26:22,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-25 05:26:22,478 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-25 05:26:22,484 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-25 05:26:22,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:26:22,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:26:22,496 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-25 05:26:22,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-25 05:26:22,544 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-25 05:26:22,544 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:26:22,869 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-25 05:26:22,893 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-25 05:26:22,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,918 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-25 05:26:22,921 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-25 05:26:22,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,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-25 05:26:22,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-25 05:26:22,928 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,932 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:22,953 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-25 05:26:23,004 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-25 05:26:23,024 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-25 05:26:23,024 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,041 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-25 05:26:23,050 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-25 05:26:23,050 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,052 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,054 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-25 05:26:23,057 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-25 05:26:23,057 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,060 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,075 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-25 05:26:23,137 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-25 05:26:23,138 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-01-25 05:26:23,325 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-25 05:26:23,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:26:23,346 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-25 05:26:23,349 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:26:23,350 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:26:23,363 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:26:23,382 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:26:23,418 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:26:23,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:26:23,429 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-25 05:26:23,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:26:23,438 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-25 05:26:23,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:23,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:26:23,448 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-25 05:26:23,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:26:23,490 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-25 05:26:23,492 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-25 05:26:23,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-25 05:26:23,590 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-25 05:26:23,592 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-25 05:26:23,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,603 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-25 05:26:23,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2018-01-25 05:26:23,660 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-25 05:26:23,666 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-25 05:26:23,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:26:23,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:26:23,677 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-25 05:26:23,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-25 05:26:23,681 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-25 05:26:23,681 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:26:23,931 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-25 05:26:23,943 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-25 05:26:23,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,956 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-25 05:26:23,957 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-25 05:26:23,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,962 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-25 05:26:23,964 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-25 05:26:23,964 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:26:23,974 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-25 05:26:23,993 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-25 05:26:23,993 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:125 [2018-01-25 05:26:24,203 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-25 05:26:24,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:26:24,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13, 13, 13] total 44 [2018-01-25 05:26:24,205 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:26:24,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:26:24,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:26:24,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 05:26:24,207 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 20 states. [2018-01-25 05:26:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:24,979 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-25 05:26:24,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:26:24,979 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-25 05:26:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:24,980 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:26:24,980 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:26:24,981 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-25 05:26:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:26:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-01-25 05:26:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:26:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-25 05:26:24,987 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 28 [2018-01-25 05:26:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:24,988 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-25 05:26:24,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:26:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-25 05:26:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:26:24,988 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:26:24,989 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-25 05:26:24,989 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-25 05:26:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1163981862, now seen corresponding path program 1 times [2018-01-25 05:26:24,989 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:26:24,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:24,990 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:26:24,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:26:24,990 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:26:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:26:25,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:26:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:26:25,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:26:25,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:26:25,078 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:26:25,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:26:25,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:26:25,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:26:25,079 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 6 states. [2018-01-25 05:26:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:26:25,191 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-25 05:26:25,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:26:25,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-25 05:26:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:26:25,192 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:26:25,192 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:26:25,193 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-25 05:26:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:26:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:26:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:26:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:26:25,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-25 05:26:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:26:25,194 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:26:25,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:26:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:26:25,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:26:25,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:26:25,237 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 05:26:25,520 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 75 DAG size of output 54 [2018-01-25 05:26:25,643 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-01-25 05:26:26,693 WARN L146 SmtUtils]: Spent 1048ms on a formula simplification. DAG size of input: 135 DAG size of output 103 [2018-01-25 05:26:26,697 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,697 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:26:26,697 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,697 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-25 05:26:26,697 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,697 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-25 05:26:26,697 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,697 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,697 INFO L401 ceAbstractionStarter]: For program point L551'(lines 551 553) no Hoare annotation was computed. [2018-01-25 05:26:26,697 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 545 560) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 545 560) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 545 560) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 545 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-25 05:26:26,698 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-25 05:26:26,699 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-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,699 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-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:26:26,699 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-25 05:26:26,700 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-25 05:26:26,700 INFO L401 ceAbstractionStarter]: For program point cstpcpyEXIT(lines 540 544) no Hoare annotation was computed. [2018-01-25 05:26:26,700 INFO L401 ceAbstractionStarter]: For program point cstpcpyFINAL(lines 540 544) no Hoare annotation was computed. [2018-01-25 05:26:26,700 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-25 05:26:26,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,737 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,737 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,737 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,740 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,740 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,746 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,746 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,746 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,746 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,746 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:26:26 BoogieIcfgContainer [2018-01-25 05:26:26,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:26:26,755 INFO L168 Benchmark]: Toolchain (without parser) took 18509.55 ms. Allocated memory was 300.4 MB in the beginning and 848.8 MB in the end (delta: 548.4 MB). Free memory was 260.5 MB in the beginning and 782.3 MB in the end (delta: -521.9 MB). Peak memory consumption was 466.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:26,756 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:26:26,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.27 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 249.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:26,757 INFO L168 Benchmark]: Boogie Preprocessor took 31.71 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:26,757 INFO L168 Benchmark]: RCFGBuilder took 263.34 ms. Allocated memory is still 300.4 MB. Free memory was 247.4 MB in the beginning and 231.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:26,757 INFO L168 Benchmark]: TraceAbstraction took 17994.36 ms. Allocated memory was 300.4 MB in the beginning and 848.8 MB in the end (delta: 548.4 MB). Free memory was 231.8 MB in the beginning and 782.3 MB in the end (delta: -550.5 MB). Peak memory consumption was 437.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:26:26,759 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.13 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.27 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 249.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.71 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.34 ms. Allocated memory is still 300.4 MB. Free memory was 247.4 MB in the beginning and 231.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 17994.36 ms. Allocated memory was 300.4 MB in the beginning and 848.8 MB in the end (delta: 548.4 MB). Free memory was 231.8 MB in the beginning and 782.3 MB in the end (delta: -550.5 MB). Peak memory consumption was 437.6 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 : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 208 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.107863 RENAME_VARIABLES(MILLISECONDS) : 0.820358 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.064370 PROJECTAWAY(MILLISECONDS) : 8.181398 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.095530 DISJOIN(MILLISECONDS) : 0.768420 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.842585 ADD_EQUALITY(MILLISECONDS) : 0.019920 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019748 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 125 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 94 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 119 #ADD_EQUALITY : 56 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 218 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 8.404963 RENAME_VARIABLES(MILLISECONDS) : 0.820790 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.199300 PROJECTAWAY(MILLISECONDS) : 0.102942 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.062854 DISJOIN(MILLISECONDS) : 0.805270 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.849175 ADD_EQUALITY(MILLISECONDS) : 0.020499 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013759 #CONJOIN_DISJUNCTIVE : 69 #RENAME_VARIABLES : 122 #UNFREEZE : 0 #CONJOIN : 115 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 115 #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-25 05:26:26,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,772 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,773 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,773 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,774 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,776 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,776 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,776 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,776 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,777 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,777 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,777 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,777 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,777 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,778 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,786 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:26:26,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:26:26,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:26:26,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:26:26,798 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, 17.8s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s 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, 6.5s 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, 5.5s 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, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-26-26-802.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-26-26-802.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-26-26-802.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-26-26-802.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-26-26-802.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-26-26-802.csv Received shutdown request...