java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:27:13,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:27:13,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:27:13,650 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:27:13,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:27:13,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:27:13,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:27:13,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:27:13,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:27:13,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:27:13,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:27:13,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:27:13,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:27:13,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:27:13,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:27:13,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:27:13,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:27:13,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:27:13,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:27:13,671 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:27:13,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:27:13,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:27:13,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:27:13,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:27:13,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:27:13,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:27:13,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:27:13,678 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:27:13,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:27:13,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:27:13,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:27:13,680 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:27:13,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:27:13,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:27:13,691 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:27:13,691 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:27:13,692 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:27:13,692 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:27:13,692 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:27:13,692 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:27:13,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:27:13,693 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:27:13,693 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:27:13,693 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:27:13,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:27:13,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:27:13,694 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:27:13,694 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:27:13,694 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:27:13,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:27:13,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:27:13,695 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:27:13,695 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:27:13,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:27:13,696 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:27:13,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:27:13,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:27:13,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:27:13,696 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:27:13,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:27:13,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:27:13,697 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:27:13,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:27:13,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:27:13,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:27:13,698 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:27:13,698 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:27:13,699 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:27:13,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:27:13,746 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:27:13,751 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:27:13,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:27:13,753 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:27:13,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:27:13,944 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:27:13,950 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:27:13,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:27:13,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:27:13,956 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:27:13,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:27:13" (1/1) ... [2018-01-25 05:27:13,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:13, skipping insertion in model container [2018-01-25 05:27:13,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:27:13" (1/1) ... [2018-01-25 05:27:13,980 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:27:14,022 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:27:14,150 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:27:14,173 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:27:14,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14 WrapperNode [2018-01-25 05:27:14,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:27:14,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:27:14,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:27:14,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:27:14,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (1/1) ... [2018-01-25 05:27:14,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (1/1) ... [2018-01-25 05:27:14,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (1/1) ... [2018-01-25 05:27:14,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (1/1) ... [2018-01-25 05:27:14,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (1/1) ... [2018-01-25 05:27:14,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (1/1) ... [2018-01-25 05:27:14,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (1/1) ... [2018-01-25 05:27:14,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:27:14,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:27:14,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:27:14,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:27:14,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (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:27:14,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:27:14,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:27:14,259 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-25 05:27:14,259 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:27:14,259 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:27:14,260 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:27:14,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:27:14,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:27:14,260 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:27:14,260 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:27:14,260 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-25 05:27:14,261 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:27:14,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:27:14,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:27:14,479 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:27:14,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:27:14 BoogieIcfgContainer [2018-01-25 05:27:14,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:27:14,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:27:14,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:27:14,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:27:14,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:27:13" (1/3) ... [2018-01-25 05:27:14,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc69f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:27:14, skipping insertion in model container [2018-01-25 05:27:14,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:14" (2/3) ... [2018-01-25 05:27:14,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc69f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:27:14, skipping insertion in model container [2018-01-25 05:27:14,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:27:14" (3/3) ... [2018-01-25 05:27:14,485 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:27:14,492 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:27:14,499 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 05:27:14,539 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:27:14,540 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:27:14,540 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:27:14,540 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:27:14,540 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:27:14,540 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:27:14,540 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:27:14,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:27:14,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:27:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-25 05:27:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:27:14,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:14,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:14,570 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-25 05:27:14,578 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:14,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:14,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:14,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:14,624 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:14,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:14,744 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:27:14,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:14,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:27:14,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:14,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:27:14,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:27:14,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:27:14,768 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-25 05:27:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:14,930 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-25 05:27:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:27:14,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 05:27:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:14,939 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:27:14,939 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 05:27:14,942 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:27:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 05:27:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-25 05:27:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 05:27:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 05:27:14,970 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-25 05:27:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:14,971 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 05:27:14,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:27:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 05:27:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:27:14,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:14,971 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:14,971 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:14,972 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-25 05:27:14,972 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:14,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:14,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:14,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:14,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:14,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:15,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:15,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:27:15,014 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:15,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:27:15,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:27:15,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:27:15,016 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-25 05:27:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:15,060 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-25 05:27:15,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:27:15,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-25 05:27:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:15,061 INFO L225 Difference]: With dead ends: 40 [2018-01-25 05:27:15,062 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 05:27:15,063 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:27:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 05:27:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-25 05:27:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 05:27:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 05:27:15,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-25 05:27:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:15,069 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 05:27:15,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:27:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 05:27:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:27:15,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:15,070 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:15,070 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-25 05:27:15,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:15,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:15,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:15,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:15,142 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:27:15,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:15,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:27:15,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:15,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:27:15,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:27:15,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:27:15,143 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-25 05:27:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:15,193 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 05:27:15,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:27:15,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:27:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:15,194 INFO L225 Difference]: With dead ends: 37 [2018-01-25 05:27:15,194 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 05:27:15,195 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:27:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 05:27:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 05:27:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:27:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:27:15,200 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-25 05:27:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:15,201 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:27:15,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:27:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:27:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:27:15,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:15,202 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:15,202 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-25 05:27:15,203 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:15,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:15,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:15,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:15,325 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:27:15,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:15,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:27:15,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:15,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:27:15,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:27:15,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:27:15,326 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-25 05:27:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:15,372 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-25 05:27:15,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:27:15,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:27:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:15,373 INFO L225 Difference]: With dead ends: 36 [2018-01-25 05:27:15,373 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:27:15,374 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:27:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:27:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 05:27:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:27:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-25 05:27:15,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-25 05:27:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:15,380 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-25 05:27:15,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:27:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-25 05:27:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:27:15,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:15,381 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:15,381 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-01-25 05:27:15,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:15,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:15,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:15,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:15,434 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:27:15,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:15,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:27:15,435 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:15,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:27:15,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:27:15,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:27:15,436 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-25 05:27:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:15,522 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-25 05:27:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:27:15,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:27:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:15,523 INFO L225 Difference]: With dead ends: 35 [2018-01-25 05:27:15,523 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 05:27:15,524 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:27:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 05:27:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-25 05:27:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 05:27:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-25 05:27:15,529 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-25 05:27:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:15,530 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-25 05:27:15,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:27:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-25 05:27:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:27:15,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:15,531 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:15,531 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-01-25 05:27:15,531 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:15,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:15,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,533 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:15,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:15,658 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:27:15,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:15,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:27:15,658 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:15,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:27:15,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:27:15,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:15,659 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-25 05:27:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:15,765 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-25 05:27:15,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:27:15,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 05:27:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:15,768 INFO L225 Difference]: With dead ends: 45 [2018-01-25 05:27:15,769 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 05:27:15,769 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:27:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 05:27:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-25 05:27:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:27:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:27:15,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-25 05:27:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:15,776 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:27:15,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:27:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:27:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:27:15,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:15,777 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:27:15,778 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-01-25 05:27:15,778 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:15,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:15,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:15,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:15,879 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:27:15,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:15,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:27:15,879 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:15,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:27:15,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:27:15,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:15,880 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-25 05:27:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:15,968 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-25 05:27:15,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:27:15,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:27:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:15,971 INFO L225 Difference]: With dead ends: 36 [2018-01-25 05:27:15,971 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:27:15,972 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:27:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:27:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 05:27:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:27:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-25 05:27:15,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-25 05:27:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:15,978 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-25 05:27:15,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:27:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-25 05:27:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:27:15,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:15,979 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:27:15,979 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-01-25 05:27:15,980 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:15,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:15,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:15,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:15,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:16,101 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:27:16,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:16,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:27:16,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:16,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:27:16,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:27:16,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:16,103 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-25 05:27:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:16,239 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-25 05:27:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:27:16,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:27:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:16,240 INFO L225 Difference]: With dead ends: 42 [2018-01-25 05:27:16,240 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:27:16,241 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:27:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:27:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-25 05:27:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:27:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:27:16,245 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-25 05:27:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:16,246 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:27:16,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:27:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:27:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:27:16,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:16,246 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:16,247 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:16,247 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-01-25 05:27:16,247 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:16,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:16,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:16,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:16,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:16,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:16,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:16,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:27:16,394 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:16,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:27:16,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:27:16,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:27:16,395 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-01-25 05:27:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:16,492 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-25 05:27:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:27:16,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-25 05:27:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:16,494 INFO L225 Difference]: With dead ends: 75 [2018-01-25 05:27:16,494 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 05:27:16,494 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:27:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 05:27:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-25 05:27:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:27:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-25 05:27:16,502 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-01-25 05:27:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:16,503 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-25 05:27:16,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:27:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-25 05:27:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:27:16,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:16,504 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:16,504 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:16,505 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-01-25 05:27:16,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:16,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:16,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:16,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:16,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:16,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:16,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:16,834 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:16,835 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 05:27:16,837 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [7], [8], [15], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-25 05:27:16,890 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:27:16,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:27:19,162 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:27:19,163 INFO L268 AbstractInterpreter]: Visited 22 different actions 38 times. Merged at 6 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-25 05:27:19,175 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:27:19,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:19,175 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:27:19,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:19,188 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:19,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:19,263 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:27:19,269 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:27:19,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:19,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:19,305 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:27:19,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:27:19,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-25 05:27:19,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:27:19,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:19,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:19,592 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:27:19,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 05:27:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:19,829 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:20,430 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:27:20,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,446 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:27:20,460 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:27:20,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,472 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:27:20,472 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 05:27:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:20,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:20,517 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:27:20,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:20,526 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:20,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:20,607 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:27:20,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:27:20,697 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:27:20,700 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:27:20,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:27:20,888 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:27:20,897 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 17 [2018-01-25 05:27:20,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:20,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:20,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:20,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-25 05:27:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:21,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:21,072 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:27:21,088 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:27:21,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:27:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:21,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:27:21,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8, 10, 10] total 33 [2018-01-25 05:27:21,176 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:27:21,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:27:21,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:27:21,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-01-25 05:27:21,178 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 17 states. [2018-01-25 05:27:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:21,720 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-25 05:27:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:27:21,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-01-25 05:27:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:21,722 INFO L225 Difference]: With dead ends: 66 [2018-01-25 05:27:21,722 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 05:27:21,723 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2018-01-25 05:27:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 05:27:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-01-25 05:27:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:27:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-25 05:27:21,733 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-01-25 05:27:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:21,733 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-25 05:27:21,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:27:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-25 05:27:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:27:21,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:21,734 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:27:21,734 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-01-25 05:27:21,735 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:21,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:21,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:21,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:21,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:21,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:21,985 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:27:21,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:21,986 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:21,986 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:27:21,986 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [15], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-25 05:27:21,988 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:27:21,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:27:25,278 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:27:25,278 INFO L268 AbstractInterpreter]: Visited 22 different actions 38 times. Merged at 6 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-25 05:27:25,291 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:27:25,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:25,292 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:27:25,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:25,299 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:25,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:25,334 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:27:25,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,355 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:27:25,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,362 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:27:25,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-25 05:27:25,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:25,400 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:27:25,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:25,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:25,412 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:27:25,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,417 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:27:25,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-25 05:27:25,581 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:27:25,581 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:25,881 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:27:25,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,885 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:27:25,894 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:27:25,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,895 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:27:25,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:25,907 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:27:25,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-25 05:27:25,933 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:27:25,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:25,954 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:27:25,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:25,957 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:26,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:26,006 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:27:26,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,021 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:27:26,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,030 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:27:26,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-25 05:27:26,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:26,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:26,049 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:27:26,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,060 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:27:26,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,069 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:27:26,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-25 05:27:26,255 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:27:26,256 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:26,500 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:27:26,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,505 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:27:26,515 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:27:26,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,516 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:27:26,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,524 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:27:26,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-25 05:27:26,528 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:27:26,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:27:26,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 10, 11] total 42 [2018-01-25 05:27:26,529 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:27:26,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:27:26,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:27:26,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 05:27:26,530 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 22 states. [2018-01-25 05:27:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:27,068 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-25 05:27:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:27:27,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-25 05:27:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:27,069 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:27:27,069 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:27:27,070 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-01-25 05:27:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:27:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-01-25 05:27:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:27:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-25 05:27:27,077 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2018-01-25 05:27:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:27,078 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-25 05:27:27,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:27:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-25 05:27:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:27:27,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:27,079 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:27,079 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-01-25 05:27:27,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:27,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:27,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:27,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:27,081 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:27,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:27,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:27,438 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:27,438 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:27:27,438 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:27:27,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:27,438 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:27:27,454 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:27:27,454 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:27:27,469 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:27,476 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:27,479 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:27:27,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:27,488 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:27:27,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:27:27,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 6 treesize of output 5 [2018-01-25 05:27:27,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:27,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:27,509 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:27:27,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:27:27,545 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:27:27,546 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:27:27,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-25 05:27:27,639 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:27:27,641 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:27:27,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:27:27,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-25 05:27:27,691 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:27:27,697 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:27:27,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:27,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:27,710 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:27:27,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-25 05:27:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:27,749 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:28,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-01-25 05:27:28,083 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:27:28,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,102 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:27:28,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-25 05:27:28,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-25 05:27:28,110 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:27:28,110 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,113 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,127 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:27:28,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-01-25 05:27:28,190 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:27:28,190 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,207 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:27:28,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-25 05:27:28,209 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,211 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-25 05:27:28,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-25 05:27:28,215 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,218 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:27:28,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-25 05:27:28,294 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-01-25 05:27:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:28,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:28,497 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:27:28,502 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:27:28,502 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:27:28,518 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:28,538 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:28,572 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:27:28,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:28,579 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:27:28,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:27:28,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:27:28,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:28,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:28,592 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:27:28,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:27:28,626 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:27:28,627 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:27:28,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-25 05:27:28,709 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:27:28,711 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:27:28,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,723 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:27:28,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2018-01-25 05:27:28,784 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:27:28,790 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:27:28,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:28,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:28,802 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:27:28,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-25 05:27:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:28,806 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:29,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-25 05:27:29,071 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:27:29,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-25 05:27:29,093 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:27:29,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,098 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:27:29,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-25 05:27:29,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,115 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:27:29,136 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:27:29,137 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:125 [2018-01-25 05:27:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:29,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:27:29,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13, 13, 13] total 45 [2018-01-25 05:27:29,346 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:27:29,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 05:27:29,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 05:27:29,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2018-01-25 05:27:29,347 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 21 states. [2018-01-25 05:27:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:30,096 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-25 05:27:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:27:30,096 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-25 05:27:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:30,097 INFO L225 Difference]: With dead ends: 63 [2018-01-25 05:27:30,097 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 05:27:30,098 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=360, Invalid=2946, Unknown=0, NotChecked=0, Total=3306 [2018-01-25 05:27:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 05:27:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-01-25 05:27:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:27:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-01-25 05:27:30,103 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2018-01-25 05:27:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:30,104 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-01-25 05:27:30,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 05:27:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-01-25 05:27:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:27:30,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:30,104 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:30,105 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:27:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-01-25 05:27:30,105 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:30,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:30,105 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:27:30,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:30,106 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:30,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:30,201 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:27:30,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:30,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:27:30,201 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:30,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:27:30,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:27:30,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:27:30,202 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-01-25 05:27:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:30,276 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-25 05:27:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:27:30,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-25 05:27:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:30,277 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:27:30,277 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:27:30,278 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:27:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:27:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:27:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:27:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:27:30,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-25 05:27:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:30,278 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:27:30,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:27:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:27:30,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:27:30,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:27:30,609 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 72 DAG size of output 55 [2018-01-25 05:27:31,009 WARN L146 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 135 DAG size of output 110 [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-25 05:27:31,080 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 05:27:31,081 INFO L397 ceAbstractionStarter]: At program point L544'''''(line 544) the Hoare annotation is: (let ((.cse18 (select |old(#memory_int)| |cstrcpy_#in~from.base|)) (.cse19 (select |#length| |cstrcpy_#in~from.base|))) (let ((.cse0 (< (select |#length| |cstrcpy_#in~to.base|) .cse19)) (.cse1 (not (= (select .cse18 (+ |cstrcpy_#in~from.offset| .cse19 (- 1))) 0))) (.cse2 (not (= (select |#valid| |cstrcpy_#in~to.base|) 1))) (.cse3 (not (= 1 (select |#valid| |cstrcpy_#in~from.base|)))) (.cse4 (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|)) (.cse15 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse16 (not (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| |cstrcpy_#in~from.base|)) (<= 1 main_~length2~4) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0))))) (.cse12 (<= cstrcpy_~to.offset 0)) (.cse17 (not (= 0 |cstrcpy_#in~from.offset|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse13 (select |#length| cstrcpy_~from.base)) (.cse14 (select |#length| cstrcpy_~to.base))) (let ((.cse6 (<= .cse13 .cse14)) (.cse5 (= 1 (select |#valid| cstrcpy_~from.base))) (.cse7 (= (select |#valid| cstrcpy_~to.base) 1)) (.cse8 (not (= cstrcpy_~to.base cstrcpy_~from.base))) (.cse9 (<= (+ cstrcpy_~from.offset 1) .cse13)) (.cse10 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| cstrcpy_~from.base) (+ (select |#length| cstrcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6) (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_6 1) cstrcpy_~from.offset)))) (.cse11 (<= 1 cstrcpy_~to.offset))) (or (and .cse5 (<= cstrcpy_~to.offset 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| cstrcpy_~from.base) (+ (select |#length| cstrcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6))) .cse5 .cse6 .cse7 (<= 0 cstrcpy_~to.offset) .cse8 (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| cstrcpy_~from.base)) (<= 1 main_~length2~4) (<= cstrcpy_~from.offset v_main_~nondetString~4.offset_BEFORE_CALL_2) (= (select (select |#memory_int| cstrcpy_~from.base) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0))) (= cstrcpy_~from.offset 0) .cse12 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 |cstrcpy_#in~from.offset|) (= (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ (select |#length| |cstrcpy_#in~from.base|) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0)))) (and (<= (+ cstrcpy_~to.offset .cse13) (+ .cse14 cstrcpy_~from.offset)) .cse5 .cse7 .cse8 .cse9 (<= 2 cstrcpy_~from.offset) .cse10 .cse11)))) .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 (select .cse18 |cstrcpy_#in~from.offset|))) .cse15 .cse16 (and (= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|)) (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) .cse12) .cse17)))) [2018-01-25 05:27:31,081 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-25 05:27:31,081 INFO L397 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 546) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |cstrcpy_#in~from.base|)) (.cse10 (select |#length| |cstrcpy_#in~from.base|))) (let ((.cse0 (< (select |#length| |cstrcpy_#in~to.base|) .cse10)) (.cse1 (not (= (select .cse5 (+ |cstrcpy_#in~from.offset| .cse10 (- 1))) 0))) (.cse2 (not (= (select |#valid| |cstrcpy_#in~to.base|) 1))) (.cse3 (not (= 1 (select |#valid| |cstrcpy_#in~from.base|)))) (.cse4 (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|)) (.cse6 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse7 (not (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| |cstrcpy_#in~from.base|)) (<= 1 main_~length2~4) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0))))) (.cse9 (not (= 0 |cstrcpy_#in~from.offset|))) (.cse8 (select |#memory_int| |cstrcpy_#in~from.base|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 (select .cse5 |cstrcpy_#in~from.offset|))) .cse6 .cse7 (= 0 (select .cse8 |cstrcpy_#in~from.offset|)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 (= (select .cse8 (+ .cse10 |cstrcpy_#in~from.offset| (- 1))) 0))))) [2018-01-25 05:27:31,081 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,081 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:27:31,081 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,081 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 562) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-25 05:27:31,082 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 562) no Hoare annotation was computed. [2018-01-25 05:27:31,083 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-25 05:27:31,083 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-25 05:27:31,083 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 562) no Hoare annotation was computed. [2018-01-25 05:27:31,083 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:27:31,083 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-25 05:27:31,083 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-25 05:27:31,083 INFO L397 ceAbstractionStarter]: At program point L559'(line 559) the Hoare annotation is: (let ((.cse1 (select |#length| |main_#t~malloc7.base|)) (.cse0 (select |#length| main_~nondetString~4.base))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= .cse0 main_~length2~4) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ main_~nondetString~4.offset .cse0 (- 1)))) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-25 05:27:31,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,110 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,110 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,124 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,124 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,124 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:27:31 BoogieIcfgContainer [2018-01-25 05:27:31,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:27:31,142 INFO L168 Benchmark]: Toolchain (without parser) took 17197.81 ms. Allocated memory was 306.7 MB in the beginning and 870.3 MB in the end (delta: 563.6 MB). Free memory was 266.6 MB in the beginning and 423.5 MB in the end (delta: -156.8 MB). Peak memory consumption was 406.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:27:31,143 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:27:31,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.84 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:27:31,143 INFO L168 Benchmark]: Boogie Preprocessor took 29.63 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 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:27:31,144 INFO L168 Benchmark]: RCFGBuilder took 267.75 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 237.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:27:31,144 INFO L168 Benchmark]: TraceAbstraction took 16661.40 ms. Allocated memory was 306.7 MB in the beginning and 870.3 MB in the end (delta: 563.6 MB). Free memory was 237.4 MB in the beginning and 423.5 MB in the end (delta: -186.0 MB). Peak memory consumption was 377.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:27:31,146 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.21 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 230.84 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.63 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 267.75 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 237.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16661.40 ms. Allocated memory was 306.7 MB in the beginning and 870.3 MB in the end (delta: 563.6 MB). Free memory was 237.4 MB in the beginning and 423.5 MB in the end (delta: -186.0 MB). Peak memory consumption was 377.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 225 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 11.135448 RENAME_VARIABLES(MILLISECONDS) : 0.619532 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 11.073191 PROJECTAWAY(MILLISECONDS) : 14.321039 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.073147 DISJOIN(MILLISECONDS) : 0.880977 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.641752 ADD_EQUALITY(MILLISECONDS) : 0.027978 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013870 #CONJOIN_DISJUNCTIVE : 68 #RENAME_VARIABLES : 120 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 92 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 113 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 233 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 12.277703 RENAME_VARIABLES(MILLISECONDS) : 0.778734 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.873139 PROJECTAWAY(MILLISECONDS) : 0.105996 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.081727 DISJOIN(MILLISECONDS) : 0.899187 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.812701 ADD_EQUALITY(MILLISECONDS) : 0.018187 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011759 #CONJOIN_DISJUNCTIVE : 67 #RENAME_VARIABLES : 117 #UNFREEZE : 0 #CONJOIN : 114 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 111 #ADD_EQUALITY : 58 #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[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] * 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 547]: 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:27:31,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:27:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:27:31,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:27:31,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:27:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:27:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((unknown-#length-unknown[to] < unknown-#length-unknown[from] || !(\old(unknown-#memory_int-unknown)[from][from + unknown-#length-unknown[from] + -1] == 0)) || !(\valid[to] == 1)) || !(1 == \valid[from])) || from == to) || ((((((((1 == \valid[from] && to <= 1) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 + 1 <= from)) && 1 <= to) || ((((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && 1 == \valid[from]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && 0 <= to) && !(to == from)) && (\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from] && 1 <= main_~length2~4) && from <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && unknown-#memory_int-unknown[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0)) && from == 0) && to <= 0) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0 && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= from) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0))) || (((((((to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from && 1 == \valid[from]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && 2 <= from) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 + 1 <= from)) && 1 <= to)) || !(0 == to)) || !(\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((from <= v_main_~nondetString~4.offset_BEFORE_CALL_2 && main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from]) && 1 <= main_~length2~4) && \old(unknown-#memory_int-unknown)[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0)) || !(0 == from)) && (((((((((unknown-#length-unknown[to] < unknown-#length-unknown[from] || !(\old(unknown-#memory_int-unknown)[from][from + unknown-#length-unknown[from] + -1] == 0)) || !(\valid[to] == 1)) || !(1 == \valid[from])) || from == to) || !(0 == \old(unknown-#memory_int-unknown)[from][from])) || !(0 == to)) || !(\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((from <= v_main_~nondetString~4.offset_BEFORE_CALL_2 && main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from]) && 1 <= main_~length2~4) && \old(unknown-#memory_int-unknown)[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0)) || ((0 == unknown-#memory_int-unknown[from][from] && 0 == unknown-#memory_int-unknown[from][from]) && to <= 0)) || !(0 == from)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 16.5s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 369 SDtfs, 488 SDslu, 1590 SDs, 0 SdLazy, 1317 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 210 SyntacticMatches, 21 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 673 HoareAnnotationTreeSize, 9 FomulaSimplifications, 176 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 641 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 524 ConstructedInterpolants, 36 QuantifiedInterpolants, 127790 SizeOfPredicates, 81 NumberOfNonLiveVariables, 714 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 2/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-27-31-192.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-27-31-192.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-27-31-192.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-27-31-192.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-27-31-192.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-27-31-192.csv Received shutdown request...