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/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:21:15,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:21:15,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:21:15,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:21:15,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:21:15,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:21:15,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:21:15,524 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:21:15,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:21:15,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:21:15,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:21:15,528 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:21:15,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:21:15,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:21:15,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:21:15,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:21:15,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:21:15,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:21:15,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:21:15,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:21:15,542 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:21:15,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:21:15,543 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:21:15,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:21:15,544 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:21:15,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:21:15,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:21:15,547 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:21:15,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:21:15,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:21:15,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:21:15,548 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:21:15,556 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:21:15,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:21:15,557 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:21:15,557 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:21:15,558 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:21:15,558 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:21:15,558 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:21:15,558 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:21:15,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:21:15,559 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:21:15,559 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:21:15,559 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:21:15,559 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:21:15,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:21:15,559 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:21:15,559 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:21:15,560 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:21:15,560 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:21:15,560 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:21:15,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:21:15,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:21:15,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:21:15,560 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:21:15,561 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:21:15,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:21:15,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:21:15,561 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:21:15,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:21:15,562 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:21:15,562 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:21:15,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:21:15,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:21:15,562 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:21:15,562 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:21:15,563 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:21:15,563 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:21:15,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:21:15,604 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:21:15,607 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:21:15,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:21:15,609 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:21:15,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:21:15,782 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:21:15,785 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:21:15,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:21:15,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:21:15,791 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:21:15,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:15,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3a9b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15, skipping insertion in model container [2018-01-25 05:21:15,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:15,808 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:21:15,846 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:21:15,962 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:21:15,979 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:21:15,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15 WrapperNode [2018-01-25 05:21:15,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:21:15,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:21:15,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:21:15,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:21:16,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:16,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:16,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:16,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:16,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:16,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:16,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (1/1) ... [2018-01-25 05:21:16,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:21:16,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:21:16,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:21:16,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:21:16,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (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:21:16,067 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:21:16,067 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:21:16,068 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-25 05:21:16,068 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:21:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:21:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:21:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:21:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:21:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:21:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:21:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-25 05:21:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:21:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:21:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:21:16,246 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:21:16,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:21:16 BoogieIcfgContainer [2018-01-25 05:21:16,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:21:16,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:21:16,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:21:16,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:21:16,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:21:15" (1/3) ... [2018-01-25 05:21:16,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6c5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:21:16, skipping insertion in model container [2018-01-25 05:21:16,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:21:15" (2/3) ... [2018-01-25 05:21:16,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6c5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:21:16, skipping insertion in model container [2018-01-25 05:21:16,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:21:16" (3/3) ... [2018-01-25 05:21:16,272 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:21:16,279 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:21:16,285 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 05:21:16,323 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:21:16,323 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:21:16,323 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:21:16,324 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:21:16,324 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:21:16,324 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:21:16,324 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:21:16,324 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:21:16,324 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:21:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-25 05:21:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:21:16,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:16,351 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:16,352 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-25 05:21:16,360 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:16,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:16,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,402 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:16,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:16,516 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:21:16,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:16,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:21:16,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:16,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:21:16,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:21:16,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:21:16,539 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-25 05:21:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:16,630 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-25 05:21:16,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:21:16,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 05:21:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:16,704 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:21:16,704 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 05:21:16,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:21:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 05:21:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-25 05:21:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 05:21:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 05:21:16,732 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-25 05:21:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:16,733 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 05:21:16,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:21:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 05:21:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:21:16,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:16,733 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:16,733 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-25 05:21:16,734 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:16,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:16,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:16,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:16,777 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:21:16,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:16,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:21:16,778 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:16,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:21:16,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:21:16,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:21:16,780 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-25 05:21:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:16,817 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-25 05:21:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:21:16,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-25 05:21:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:16,819 INFO L225 Difference]: With dead ends: 40 [2018-01-25 05:21:16,819 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 05:21:16,820 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:21:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 05:21:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-25 05:21:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 05:21:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 05:21:16,826 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-25 05:21:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:16,827 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 05:21:16,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:21:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 05:21:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:21:16,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:16,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:16,828 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-25 05:21:16,829 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:16,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:16,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,830 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:16,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:16,883 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:21:16,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:16,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:21:16,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:16,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:21:16,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:21:16,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:21:16,885 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-25 05:21:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:16,946 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 05:21:16,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:21:16,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:21:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:16,948 INFO L225 Difference]: With dead ends: 37 [2018-01-25 05:21:16,948 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 05:21:16,948 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:21:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 05:21:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 05:21:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:21:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:21:16,955 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-25 05:21:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:16,956 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:21:16,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:21:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:21:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:21:16,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:16,957 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:16,957 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-25 05:21:16,957 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:16,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:16,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:16,959 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:16,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:17,104 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:21:17,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:17,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:21:17,105 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:17,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:21:17,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:21:17,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:21:17,106 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-25 05:21:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:17,155 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-25 05:21:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:21:17,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:21:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:17,156 INFO L225 Difference]: With dead ends: 36 [2018-01-25 05:21:17,156 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:21:17,156 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:21:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:21:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 05:21:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:21:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-25 05:21:17,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-25 05:21:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:17,160 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-25 05:21:17,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:21:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-25 05:21:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:21:17,161 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:17,161 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:21:17,161 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-01-25 05:21:17,162 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:17,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:17,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,163 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:17,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:17,220 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:21:17,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:17,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:21:17,220 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:17,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:21:17,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:21:17,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:21:17,221 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-25 05:21:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:17,324 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-25 05:21:17,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:21:17,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 05:21:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:17,325 INFO L225 Difference]: With dead ends: 35 [2018-01-25 05:21:17,325 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 05:21:17,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:21:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 05:21:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-25 05:21:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 05:21:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-25 05:21:17,330 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-01-25 05:21:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:17,330 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-25 05:21:17,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:21:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-25 05:21:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:21:17,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:17,331 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:21:17,331 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-01-25 05:21:17,332 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:17,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:17,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,333 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:17,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:17,444 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:21:17,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:17,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:21:17,445 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:17,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:21:17,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:21:17,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:21:17,446 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-01-25 05:21:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:17,586 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-25 05:21:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:21:17,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 05:21:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:17,587 INFO L225 Difference]: With dead ends: 42 [2018-01-25 05:21:17,587 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:21:17,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:21:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:21:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-25 05:21:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 05:21:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 05:21:17,592 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-01-25 05:21:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:17,592 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 05:21:17,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:21:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 05:21:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:21:17,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:17,593 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] [2018-01-25 05:21:17,593 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-01-25 05:21:17,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:17,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:17,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:17,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:17,692 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:21:17,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:17,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:21:17,693 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:17,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:21:17,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:21:17,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:21:17,693 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-01-25 05:21:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:17,775 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 05:21:17,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:21:17,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 05:21:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:17,777 INFO L225 Difference]: With dead ends: 37 [2018-01-25 05:21:17,777 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 05:21:17,777 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:21:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 05:21:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 05:21:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:21:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:21:17,783 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-01-25 05:21:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:17,783 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:21:17,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:21:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:21:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:21:17,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:17,785 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] [2018-01-25 05:21:17,785 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-01-25 05:21:17,785 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:17,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:17,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:17,787 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:17,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:17,915 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:21:17,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:17,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:21:17,915 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:17,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:21:17,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:21:17,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:21:17,916 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-01-25 05:21:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:18,067 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-25 05:21:18,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:21:18,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 05:21:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:18,068 INFO L225 Difference]: With dead ends: 39 [2018-01-25 05:21:18,068 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 05:21:18,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:21:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 05:21:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-25 05:21:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 05:21:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 05:21:18,072 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-01-25 05:21:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:18,072 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 05:21:18,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:21:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 05:21:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:21:18,073 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:18,073 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:21:18,073 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:18,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-01-25 05:21:18,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:18,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:18,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:18,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:18,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:18,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:18,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:18,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:21:18,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:18,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:21:18,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:21:18,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:21:18,244 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-25 05:21:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:18,410 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-25 05:21:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:21:18,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-25 05:21:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:18,411 INFO L225 Difference]: With dead ends: 77 [2018-01-25 05:21:18,412 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 05:21:18,412 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:21:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 05:21:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-25 05:21:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:21:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-25 05:21:18,418 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-25 05:21:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:18,418 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-25 05:21:18,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:21:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-25 05:21:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:21:18,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:18,419 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:21:18,419 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:18,419 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-01-25 05:21:18,420 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:18,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:18,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:18,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:18,420 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:18,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:18,586 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:21:18,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:18,586 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:21:18,587 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:21:18,589 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [7], [9], [10], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-25 05:21:18,629 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:21:18,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:21:21,705 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:21:21,707 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 27 variables. [2018-01-25 05:21:21,757 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:21:21,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:21,758 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:21:21,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:21,769 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:21:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:21,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:21,863 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:21:21,871 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:21:21,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:21,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:21,882 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:21:21,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:21:22,030 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:21:22,041 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:21:22,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:22,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:22,064 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:21:22,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 05:21:22,119 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:21:22,119 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:22,393 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:21:22,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,403 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:21:22,415 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:21:22,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,422 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:21:22,422 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 05:21:22,429 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:21:22,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:22,457 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:21:22,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:22,464 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:21:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:22,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:22,534 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:21:22,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:21:22,594 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:21:22,596 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:21:22,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:22,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:21:22,766 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:21:22,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:21:22,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:22,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:22,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:22,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 05:21:22,935 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:21:22,935 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:23,056 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:21:23,067 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:21:23,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:23,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:23,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:23,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:21:23,129 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:21:23,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:21:23,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-25 05:21:23,132 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:21:23,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:21:23,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:21:23,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 05:21:23,134 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-01-25 05:21:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:23,675 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-25 05:21:23,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:21:23,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-25 05:21:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:23,678 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:21:23,678 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 05:21:23,679 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 05:21:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 05:21:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-25 05:21:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:21:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-25 05:21:23,689 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-25 05:21:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:23,689 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-25 05:21:23,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:21:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-25 05:21:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:21:23,690 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:23,690 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:23,691 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-01-25 05:21:23,691 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:23,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:23,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:23,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:23,692 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:23,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:24,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:24,038 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:21:24,038 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 05:21:24,039 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [7], [10], [12], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-25 05:21:24,040 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:21:24,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:21:26,373 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:21:26,373 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 27 variables. [2018-01-25 05:21:26,380 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:21:26,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:26,381 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:21:26,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:26,386 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:21:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:26,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:26,435 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:21:26,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:26,497 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:21:26,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:26,545 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:21:26,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-25 05:21:26,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:26,749 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:21:26,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:26,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:26,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:26,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:21:26,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:26,860 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:21:26,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-25 05:21:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:27,282 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:27,668 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:21:27,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,672 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:21:27,680 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:21:27,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,681 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:21:27,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,688 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:21:27,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-25 05:21:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:27,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:27,737 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:21:27,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:27,743 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:21:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:27,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:27,797 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:21:27,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,828 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:21:27,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,835 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:21:27,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-25 05:21:27,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:27,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:27,851 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:21:27,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,869 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:21:27,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:27,874 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:21:27,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-25 05:21:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:28,051 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:28,230 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:21:28,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:28,234 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:21:28,244 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:21:28,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:28,245 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:21:28,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:28,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:28,255 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:21:28,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-25 05:21:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:28,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:21:28,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13, 12, 12] total 46 [2018-01-25 05:21:28,262 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:21:28,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-25 05:21:28,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-25 05:21:28,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 05:21:28,264 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2018-01-25 05:21:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:29,054 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-25 05:21:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:21:29,055 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-01-25 05:21:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:29,056 INFO L225 Difference]: With dead ends: 62 [2018-01-25 05:21:29,056 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 05:21:29,057 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=402, Invalid=3258, Unknown=0, NotChecked=0, Total=3660 [2018-01-25 05:21:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 05:21:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-25 05:21:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:21:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-25 05:21:29,064 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-01-25 05:21:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:29,065 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-25 05:21:29,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-25 05:21:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-25 05:21:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:21:29,066 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:29,066 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:21:29,066 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-01-25 05:21:29,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:29,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:29,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:21:29,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:29,068 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:29,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:29,401 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-01-25 05:21:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:29,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:29,609 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:21:29,609 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:21:29,609 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:21:29,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:29,609 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:21:29,621 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:21:29,621 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:21:29,635 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:29,641 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:29,643 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:21:29,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:29,649 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:21:29,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:21:29,671 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:21:29,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:29,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:29,679 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:21:29,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:21:29,716 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:21:29,717 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:21:29,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,724 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:21:29,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-25 05:21:29,864 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:21:29,866 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:21:29,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:29,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:21:29,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-25 05:21:29,957 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 22 treesize of output 18 [2018-01-25 05:21:29,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-25 05:21:29,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:29,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:29,976 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:21:29,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-25 05:21:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:30,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:30,487 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 39 treesize of output 30 [2018-01-25 05:21:30,500 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:21:30,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,511 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 21 treesize of output 17 [2018-01-25 05:21:30,513 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 17 treesize of output 12 [2018-01-25 05:21:30,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,517 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 22 treesize of output 20 [2018-01-25 05:21:30,519 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:21:30,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,533 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:21:30,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:21:30,552 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-25 05:21:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:30,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:21:30,718 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:21:30,722 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:21:30,722 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:21:30,737 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:30,756 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:21:30,791 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:21:30,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:21:30,799 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:21:30,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:21:30,805 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:21:30,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:30,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:21:30,811 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:21:30,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:21:30,848 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 15 treesize of output 12 [2018-01-25 05:21:30,850 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:21:30,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:30,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 05:21:31,023 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 23 treesize of output 24 [2018-01-25 05:21:31,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 8 treesize of output 7 [2018-01-25 05:21:31,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:31,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:31,032 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:21:31,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-25 05:21:31,109 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 21 treesize of output 17 [2018-01-25 05:21:31,123 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 17 treesize of output 14 [2018-01-25 05:21:31,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:21:31,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:31,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:21:31,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-25 05:21:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:31,166 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:21:41,508 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 39 treesize of output 30 [2018-01-25 05:21:41,522 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:21:41,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:41,538 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 21 treesize of output 17 [2018-01-25 05:21:41,541 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 17 treesize of output 12 [2018-01-25 05:21:41,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:41,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:41,544 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 22 treesize of output 20 [2018-01-25 05:21:41,545 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:21:41,546 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:21:41,548 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:21:41,558 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:21:41,576 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:21:41,576 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-25 05:21:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:21:41,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:21:41,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 54 [2018-01-25 05:21:41,766 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:21:41,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-25 05:21:41,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-25 05:21:41,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2763, Unknown=5, NotChecked=0, Total=2970 [2018-01-25 05:21:41,767 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2018-01-25 05:21:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:42,817 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-25 05:21:42,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:21:42,817 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2018-01-25 05:21:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:42,818 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:21:42,818 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 05:21:42,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=484, Invalid=4481, Unknown=5, NotChecked=0, Total=4970 [2018-01-25 05:21:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 05:21:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-01-25 05:21:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:21:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-25 05:21:42,825 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 29 [2018-01-25 05:21:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:42,825 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-25 05:21:42,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-25 05:21:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-25 05:21:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:21:42,826 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:21:42,826 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, 1] [2018-01-25 05:21:42,826 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:21:42,826 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-01-25 05:21:42,826 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:21:42,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:42,827 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:21:42,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:21:42,827 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:21:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:21:42,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:21:42,913 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:21:42,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:21:42,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:21:42,913 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:21:42,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:21:42,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:21:42,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:21:42,914 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 6 states. [2018-01-25 05:21:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:21:42,979 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-25 05:21:42,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:21:42,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 05:21:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:21:42,980 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:21:42,980 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:21:42,980 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:21:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:21:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:21:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:21:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:21:42,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-25 05:21:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:21:42,981 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:21:42,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:21:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:21:42,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:21:42,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:21:43,802 WARN L146 SmtUtils]: Spent 742ms on a formula simplification. DAG size of input: 79 DAG size of output 52 [2018-01-25 05:21:44,375 WARN L146 SmtUtils]: Spent 570ms on a formula simplification. DAG size of input: 130 DAG size of output 90 [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-25 05:21:44,456 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,457 INFO L401 ceAbstractionStarter]: For program point L544''''''(lines 544 545) no Hoare annotation was computed. [2018-01-25 05:21:44,457 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 05:21:44,457 INFO L397 ceAbstractionStarter]: At program point L544'''''(lines 544 545) the Hoare annotation is: (let ((.cse18 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse0 (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1))) (.cse8 (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (.cse9 (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|)))) (.cse10 (not (= |cstrcpy_#in~s1.offset| 0))) (.cse3 (= 0 cstrcpy_~src~2.offset)) (.cse14 (not (= 0 |cstrcpy_#in~s2.offset|))) (.cse15 (< (select |#length| |cstrcpy_#in~s1.base|) .cse18)) (.cse16 (not (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) (+ (select |#length| |cstrcpy_#in~s2.base|) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))))) (.cse17 (< .cse18 1))) (and (let ((.cse5 (select |#length| cstrcpy_~src~2.base)) (.cse13 (select |#length| cstrcpy_~dst~2.base))) (let ((.cse1 (not (= cstrcpy_~src~2.base cstrcpy_~dst~2.base))) (.cse11 (<= 1 cstrcpy_~dst~2.offset)) (.cse2 (= 1 (select |#valid| cstrcpy_~src~2.base))) (.cse4 (<= .cse5 .cse13)) (.cse12 (<= (+ cstrcpy_~src~2.offset 1) .cse5)) (.cse6 (= 1 (select |#valid| cstrcpy_~dst~2.base))) (.cse7 (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| cstrcpy_~src~2.base) (+ main_~nondetString~3.offset (select |#length| cstrcpy_~src~2.base) (- 1))) 0) (<= main_~nondetString~3.offset 0))))) (or .cse0 (and .cse1 (= 0 cstrcpy_~dst~2.offset) .cse2 .cse3 .cse4 (<= 1 .cse5) (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| |cstrcpy_#in~s2.base|) (+ main_~nondetString~3.offset (select |#length| |cstrcpy_#in~s2.base|) (- 1))) 0) (<= main_~nondetString~3.offset 0))) .cse6 .cse7) .cse8 .cse9 .cse10 (and .cse1 .cse11 .cse2 (<= 2 cstrcpy_~src~2.offset) .cse12 .cse6 .cse7 (<= (+ cstrcpy_~dst~2.offset .cse5) (+ cstrcpy_~src~2.offset .cse13))) .cse14 .cse15 .cse16 (and .cse1 .cse11 .cse2 (<= cstrcpy_~dst~2.offset 1) .cse4 .cse12 .cse6 .cse7 (<= 1 cstrcpy_~src~2.offset)) .cse17))) (or .cse0 .cse8 .cse9 .cse10 (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) (and (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) (= 0 (select (select |#memory_int| cstrcpy_~src~2.base) cstrcpy_~src~2.offset)) .cse3) .cse14 .cse15 .cse16 .cse17)))) [2018-01-25 05:21:44,457 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-25 05:21:44,457 INFO L397 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 547) the Hoare annotation is: (let ((.cse8 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse0 (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1))) (.cse1 (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (.cse2 (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|)))) (.cse3 (not (= |cstrcpy_#in~s1.offset| 0))) (.cse4 (not (= 0 |cstrcpy_#in~s2.offset|))) (.cse5 (< (select |#length| |cstrcpy_#in~s1.base|) .cse8)) (.cse6 (not (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) (+ (select |#length| |cstrcpy_#in~s2.base|) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))))) (.cse7 (< .cse8 1))) (and (or .cse0 .cse1 .cse2 (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| |cstrcpy_#in~s2.base|) (+ main_~nondetString~3.offset (select |#length| |cstrcpy_#in~s2.base|) (- 1))) 0) (<= main_~nondetString~3.offset 0))) .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) .cse3 (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) .cse4 .cse5 .cse6 .cse7)))) [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 563) no Hoare annotation was computed. [2018-01-25 05:21:44,458 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L559'''(line 559) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L559''(line 559) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L397 ceAbstractionStarter]: At program point L560'(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 main_~nondetArea~3.offset) (= 0 |main_#t~malloc6.offset|) (not (= main_~nondetArea~3.base main_~nondetString~3.base)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~3 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~3.base |main_#t~malloc7.base|)) (= 1 (select |#valid| main_~nondetArea~3.base)) (<= main_~length2~3 main_~length1~3) (= 0 |main_#t~malloc7.offset|) (= main_~length2~3 (select |#length| |main_#t~malloc7.base|)) (= main_~length2~3 .cse0) (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ (select |#length| main_~nondetString~3.base) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))) (= |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|))) (= 0 main_~nondetString~3.offset) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (<= 1 main_~length2~3) (= (select |#valid| |main_#t~malloc6.base|) 1) (<= .cse0 (select |#length| main_~nondetArea~3.base)))) [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 563) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-25 05:21:44,459 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-25 05:21:44,460 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 563) no Hoare annotation was computed. [2018-01-25 05:21:44,460 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:21:44,460 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-25 05:21:44,460 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-25 05:21:44,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,470 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,470 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,473 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,473 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,473 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,474 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,474 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,477 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,478 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,478 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,478 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,481 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,481 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,481 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,481 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,481 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,481 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,484 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,494 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,494 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,496 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,496 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,497 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,497 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,497 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,502 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,502 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,502 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:21:44 BoogieIcfgContainer [2018-01-25 05:21:44,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:21:44,511 INFO L168 Benchmark]: Toolchain (without parser) took 28728.91 ms. Allocated memory was 304.6 MB in the beginning and 893.9 MB in the end (delta: 589.3 MB). Free memory was 263.7 MB in the beginning and 320.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 532.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:44,512 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:21:44,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.02 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:44,512 INFO L168 Benchmark]: Boogie Preprocessor took 35.82 ms. Allocated memory is still 304.6 MB. Free memory was 253.6 MB in the beginning and 251.6 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:21:44,512 INFO L168 Benchmark]: RCFGBuilder took 243.60 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 235.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:44,513 INFO L168 Benchmark]: TraceAbstraction took 28242.32 ms. Allocated memory was 304.6 MB in the beginning and 893.9 MB in the end (delta: 589.3 MB). Free memory was 235.1 MB in the beginning and 320.2 MB in the end (delta: -85.1 MB). Peak memory consumption was 504.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:21:44,515 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.12 ms. Allocated memory is still 304.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.02 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.82 ms. Allocated memory is still 304.6 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 243.60 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 235.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 28242.32 ms. Allocated memory was 304.6 MB in the beginning and 893.9 MB in the end (delta: 589.3 MB). Free memory was 235.1 MB in the beginning and 320.2 MB in the end (delta: -85.1 MB). Peak memory consumption was 504.2 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 : 244 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 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 : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 14.094524 RENAME_VARIABLES(MILLISECONDS) : 2.423837 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 14.004992 PROJECTAWAY(MILLISECONDS) : 67.893846 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.106820 DISJOIN(MILLISECONDS) : 0.625472 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.477755 ADD_EQUALITY(MILLISECONDS) : 0.041988 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017855 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 128 #UNFREEZE : 0 #CONJOIN : 126 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 64 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 256 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 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 : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.583478 RENAME_VARIABLES(MILLISECONDS) : 1.245604 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.535546 PROJECTAWAY(MILLISECONDS) : 5.392589 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.062897 DISJOIN(MILLISECONDS) : 0.324856 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.276125 ADD_EQUALITY(MILLISECONDS) : 0.037133 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011384 #CONJOIN_DISJUNCTIVE : 74 #RENAME_VARIABLES : 132 #UNFREEZE : 0 #CONJOIN : 128 #PROJECTAWAY : 98 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 125 #ADD_EQUALITY : 64 #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_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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 #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 #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 #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 #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 #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 #memory_int - 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: 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: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-25 05:21:44,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,530 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-25 05:21:44,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:21:44,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:21:44,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(\valid[s1] == 1) || ((((((((!(src == dst) && 0 == dst) && 1 == \valid[src]) && 0 == src) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && 1 <= unknown-#length-unknown[src]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[s2][main_~nondetString~3.offset + unknown-#length-unknown[s2] + -1] == 0) && main_~nondetString~3.offset <= 0)) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0))) || s1 == s2) || !(1 == \valid[s2])) || !(s1 == 0)) || (((((((!(src == dst) && 1 <= dst) && 1 == \valid[src]) && 2 <= src) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0)) && dst + unknown-#length-unknown[src] <= src + unknown-#length-unknown[dst])) || !(0 == s2)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || !(\exists main_~nondetString~3.offset : int :: (0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~3.offset + -1] && 0 <= main_~nondetString~3.offset) && main_~nondetString~3.offset <= 0)) || ((((((((!(src == dst) && 1 <= dst) && 1 == \valid[src]) && dst <= 1) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0)) && 1 <= src)) || unknown-#length-unknown[s2] < 1) && (((((((((!(\valid[s1] == 1) || s1 == s2) || !(1 == \valid[s2])) || !(s1 == 0)) || !(\old(unknown-#memory_int-unknown)[s2][s2] == 0)) || ((0 == unknown-#memory_int-unknown[s2][s2] && 0 == unknown-#memory_int-unknown[src][src]) && 0 == src)) || !(0 == s2)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || !(\exists main_~nondetString~3.offset : int :: (0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~3.offset + -1] && 0 <= main_~nondetString~3.offset) && main_~nondetString~3.offset <= 0)) || unknown-#length-unknown[s2] < 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 28.1s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 464 SDslu, 1736 SDs, 0 SdLazy, 1553 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 213 SyntacticMatches, 15 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=10, 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, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 604 HoareAnnotationTreeSize, 9 FomulaSimplifications, 182 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 742 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 545 ConstructedInterpolants, 43 QuantifiedInterpolants, 140384 SizeOfPredicates, 117 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 3/93 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/cstrcpy-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-21-44-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-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-21-44-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-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-21-44-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-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-21-44-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-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-21-44-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-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-21-44-564.csv Received shutdown request...