java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:47:46,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:47:46,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:47:46,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:47:46,178 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:47:46,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:47:46,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:47:46,182 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:47:46,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:47:46,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:47:46,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:47:46,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:47:46,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:47:46,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:47:46,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:47:46,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:47:46,193 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:47:46,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:47:46,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:47:46,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:47:46,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:47:46,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:47:46,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:47:46,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:47:46,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:47:46,203 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:47:46,203 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:47:46,204 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:47:46,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:47:46,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:47:46,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:47:46,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:47:46,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:47:46,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:47:46,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:47:46,217 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:47:46,217 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:47:46,217 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:47:46,217 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:47:46,217 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:47:46,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:47:46,218 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:47:46,218 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:47:46,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:47:46,219 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:47:46,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:47:46,219 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:47:46,219 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:47:46,219 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:47:46,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:47:46,220 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:47:46,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:47:46,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:47:46,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:47:46,221 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:47:46,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:47:46,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:47:46,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:47:46,221 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:47:46,222 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:47:46,222 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:47:46,222 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:47:46,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:47:46,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:47:46,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:47:46,223 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:47:46,223 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:47:46,224 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:47:46,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:47:46,269 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:47:46,272 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:47:46,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:47:46,273 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:47:46,274 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-24 16:47:46,424 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:47:46,430 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:47:46,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:47:46,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:47:46,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:47:46,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c01df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46, skipping insertion in model container [2018-01-24 16:47:46,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,460 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:47:46,500 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:47:46,614 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:47:46,636 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:47:46,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46 WrapperNode [2018-01-24 16:47:46,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:47:46,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:47:46,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:47:46,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:47:46,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... [2018-01-24 16:47:46,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:47:46,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:47:46,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:47:46,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:47:46,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:47:46,720 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:47:46,720 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:47:46,721 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 16:47:46,721 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:47:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:47:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:47:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:47:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:47:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:47:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:47:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 16:47:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:47:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:47:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:47:46,924 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:47:46,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:47:46 BoogieIcfgContainer [2018-01-24 16:47:46,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:47:46,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:47:46,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:47:46,927 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:47:46,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:47:46" (1/3) ... [2018-01-24 16:47:46,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f99cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:47:46, skipping insertion in model container [2018-01-24 16:47:46,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:47:46" (2/3) ... [2018-01-24 16:47:46,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f99cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:47:46, skipping insertion in model container [2018-01-24 16:47:46,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:47:46" (3/3) ... [2018-01-24 16:47:46,931 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:47:46,938 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:47:46,943 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 16:47:46,991 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:47:46,991 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:47:46,991 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:47:46,991 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:47:46,992 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:47:46,992 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:47:46,992 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:47:46,992 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:47:46,993 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:47:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 16:47:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:47:47,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:47,016 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:47,016 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 16:47:47,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:47,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:47,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,062 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:47,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:47,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:47,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:47:47,191 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:47,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:47:47,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:47:47,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:47:47,208 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 16:47:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:47,301 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 16:47:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:47:47,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 16:47:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:47,374 INFO L225 Difference]: With dead ends: 57 [2018-01-24 16:47:47,374 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 16:47:47,378 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:47:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 16:47:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 16:47:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 16:47:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 16:47:47,407 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 16:47:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:47,407 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 16:47:47,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:47:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 16:47:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:47:47,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:47,408 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:47,408 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 16:47:47,408 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:47,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:47,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,409 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:47,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:47,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:47,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:47:47,446 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:47,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:47:47,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:47:47,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:47:47,449 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 16:47:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:47,508 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 16:47:47,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:47:47,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 16:47:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:47,510 INFO L225 Difference]: With dead ends: 40 [2018-01-24 16:47:47,510 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 16:47:47,511 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:47:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 16:47:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 16:47:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 16:47:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 16:47:47,517 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 16:47:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:47,518 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 16:47:47,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:47:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 16:47:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:47:47,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:47,519 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:47,519 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 16:47:47,519 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:47,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:47,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:47,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:47,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:47,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:47:47,593 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:47,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:47:47,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:47:47,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:47:47,594 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 16:47:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:47,671 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 16:47:47,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:47:47,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:47:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:47,672 INFO L225 Difference]: With dead ends: 37 [2018-01-24 16:47:47,672 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 16:47:47,673 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:47:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 16:47:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 16:47:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:47:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:47:47,678 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 16:47:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:47,679 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:47:47,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:47:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:47:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:47:47,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:47,680 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:47,680 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 16:47:47,680 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:47,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:47,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,682 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:47,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:47,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:47,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:47:47,805 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:47,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:47:47,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:47:47,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:47:47,806 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 16:47:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:47,857 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 16:47:47,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:47:47,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:47:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:47,859 INFO L225 Difference]: With dead ends: 36 [2018-01-24 16:47:47,859 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 16:47:47,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:47:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 16:47:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 16:47:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 16:47:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 16:47:47,864 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 16:47:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:47,865 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 16:47:47,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:47:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 16:47:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:47:47,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:47,865 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:47,865 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:47,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-01-24 16:47:47,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:47,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:47,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:47,867 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:47,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:47,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:47,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:47:47,912 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:47,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:47:47,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:47:47,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:47:47,913 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 16:47:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:48,027 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 16:47:48,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:47:48,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:47:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:48,028 INFO L225 Difference]: With dead ends: 35 [2018-01-24 16:47:48,028 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 16:47:48,029 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:47:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 16:47:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 16:47:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 16:47:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 16:47:48,034 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-24 16:47:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:48,035 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 16:47:48,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:47:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 16:47:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:47:48,036 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:48,036 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:48,036 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-01-24 16:47:48,036 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:48,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:48,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,038 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:48,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:48,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:48,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:47:48,136 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:48,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:47:48,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:47:48,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:47:48,137 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-24 16:47:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:48,246 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 16:47:48,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:47:48,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 16:47:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:48,250 INFO L225 Difference]: With dead ends: 45 [2018-01-24 16:47:48,250 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 16:47:48,251 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:47:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 16:47:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-24 16:47:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:47:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:47:48,257 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-24 16:47:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:48,258 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:47:48,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:47:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:47:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:47:48,259 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:48,259 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:48,259 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-01-24 16:47:48,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:48,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:48,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:48,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:48,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:48,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:47:48,365 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:48,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:47:48,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:47:48,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:47:48,365 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-24 16:47:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:48,445 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 16:47:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:47:48,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 16:47:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:48,446 INFO L225 Difference]: With dead ends: 36 [2018-01-24 16:47:48,446 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 16:47:48,447 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-24 16:47:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 16:47:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 16:47:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 16:47:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 16:47:48,452 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-24 16:47:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:48,452 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 16:47:48,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:47:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 16:47:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:47:48,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:48,453 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:48,454 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-01-24 16:47:48,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:48,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:48,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,455 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:48,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:48,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:48,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:47:48,552 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:48,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:47:48,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:47:48,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:47:48,553 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-24 16:47:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:48,670 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 16:47:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:47:48,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 16:47:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:48,671 INFO L225 Difference]: With dead ends: 42 [2018-01-24 16:47:48,671 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 16:47:48,671 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:47:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 16:47:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-24 16:47:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:47:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:47:48,677 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-24 16:47:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:48,678 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:47:48,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:47:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:47:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:47:48,679 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:48,679 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:48,679 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-01-24 16:47:48,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:48,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:48,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:48,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:48,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:48,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:47:48,819 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:48,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:47:48,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:47:48,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:47:48,820 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-01-24 16:47:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:48,911 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-24 16:47:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:47:48,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 16:47:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:48,912 INFO L225 Difference]: With dead ends: 75 [2018-01-24 16:47:48,913 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 16:47:48,913 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-24 16:47:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 16:47:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-24 16:47:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:47:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-24 16:47:48,919 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-01-24 16:47:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:48,920 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-24 16:47:48,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:47:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-24 16:47:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:47:48,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:48,921 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:48,921 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-01-24 16:47:48,922 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:48,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:48,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:48,923 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:48,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:49,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:49,171 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:47:49,172 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 16:47:49,174 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-24 16:47:49,220 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:47:49,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:47:49,433 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:47:49,435 INFO L268 AbstractInterpreter]: Visited 22 different actions 32 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-24 16:47:49,450 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:47:49,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:49,450 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:47:49,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:49,458 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:47:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:49,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:49,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:47:49,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:47:49,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:49,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:49,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:49,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:47:49,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 16:47:49,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:47:49,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:49,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:49,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:49,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 16:47:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:49,841 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:49,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:47:49,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:49,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:47:49,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:47:49,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:49,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,001 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 16:47:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:50,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:50,038 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:47:50,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:50,041 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:47:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:50,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:50,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:50,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:47:50,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:50,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:47:50,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:47:50,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:47:50,244 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-24 16:47:50,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:50,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:50,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:50,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-24 16:47:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:50,327 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:50,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:47:50,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:47:50,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:50,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:47:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:50,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:47:50,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8, 10, 10] total 33 [2018-01-24 16:47:50,461 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:47:50,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 16:47:50,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 16:47:50,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 16:47:50,462 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 17 states. [2018-01-24 16:47:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:50,860 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 16:47:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:47:50,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-01-24 16:47:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:50,861 INFO L225 Difference]: With dead ends: 66 [2018-01-24 16:47:50,861 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 16:47:50,862 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 16:47:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 16:47:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-01-24 16:47:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:47:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 16:47:50,872 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-01-24 16:47:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:50,872 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 16:47:50,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 16:47:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 16:47:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:47:50,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:50,873 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:50,873 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:50,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-01-24 16:47:50,873 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:50,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:50,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:50,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:50,874 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:50,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:51,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:51,087 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:47:51,087 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 16:47:51,088 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-24 16:47:51,089 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:47:51,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:47:51,211 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:47:51,212 INFO L268 AbstractInterpreter]: Visited 22 different actions 32 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-24 16:47:51,213 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:47:51,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:51,213 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:47:51,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:51,227 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:47:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:51,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:51,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:51,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:51,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 16:47:51,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:51,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:51,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:51,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:51,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:51,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 16:47:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:51,559 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:51,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 16:47:51,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:47:51,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 16:47:51,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,907 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:47:51,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:51,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:47:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:51,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:51,970 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:47:51,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:51,973 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:47:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:52,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:52,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:52,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:52,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 16:47:52,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:52,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:52,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:52,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:47:52,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-24 16:47:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:52,241 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:52,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 16:47:52,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:47:52,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 16:47:52,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,490 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:47:52,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:52,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:47:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:52,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:47:52,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 10, 11] total 42 [2018-01-24 16:47:52,502 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:47:52,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 16:47:52,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 16:47:52,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 16:47:52,503 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 22 states. [2018-01-24 16:47:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:53,034 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 16:47:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:47:53,034 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-24 16:47:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:53,035 INFO L225 Difference]: With dead ends: 64 [2018-01-24 16:47:53,036 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 16:47:53,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 16:47:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 16:47:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-01-24 16:47:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 16:47:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-24 16:47:53,045 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2018-01-24 16:47:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:53,045 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-24 16:47:53,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 16:47:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-24 16:47:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:47:53,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:53,047 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:53,047 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-01-24 16:47:53,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:53,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:53,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:47:53,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:53,048 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:53,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:53,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:53,377 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:47:53,378 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:47:53,378 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:47:53,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:53,378 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:47:53,390 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:47:53,390 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:47:53,401 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:53,407 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:53,409 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:47:53,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:53,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:53,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:47:53,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:53,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:53,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:53,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:53,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:47:53,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:53,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:47:53,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 16:47:53,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 16:47:53,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:53,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:53,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:47:53,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-24 16:47:53,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:47:53,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:53,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:53,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:53,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:53,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 16:47:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:53,659 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:53,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-01-24 16:47:53,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 16:47:53,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:47:54,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:47:54,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 16:47:54,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 16:47:54,013 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:47:54,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-01-24 16:47:54,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 16:47:54,091 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 16:47:54,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 16:47:54,108 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,111 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:47:54,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:47:54,114 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,115 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,129 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:47:54,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 16:47:54,187 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-01-24 16:47:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:54,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:47:54,381 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:47:54,386 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:47:54,386 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:47:54,398 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:54,416 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:47:54,449 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:47:54,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:47:54,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:54,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:47:54,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:47:54,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:54,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:47:54,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:47:54,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:47:54,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:54,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:47:54,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-24 16:47:54,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 16:47:54,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:47:54,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2018-01-24 16:47:54,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 16:47:54,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:47:54,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:47:54,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:54,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:47:54,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 16:47:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:54,714 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:47:54,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:47:54,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 16:47:54,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 16:47:54,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 16:47:54,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:47:54,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:47:54,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:47:54,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:47:55,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:47:55,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:125 [2018-01-24 16:47:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:55,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:47:55,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13, 13, 13] total 45 [2018-01-24 16:47:55,200 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:47:55,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:47:55,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:47:55,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 16:47:55,201 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 21 states. [2018-01-24 16:47:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:55,985 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-24 16:47:55,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:47:55,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 16:47:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:55,986 INFO L225 Difference]: With dead ends: 63 [2018-01-24 16:47:55,986 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 16:47:55,987 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-24 16:47:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 16:47:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-01-24 16:47:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 16:47:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-01-24 16:47:55,995 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2018-01-24 16:47:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:55,995 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-01-24 16:47:55,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:47:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-01-24 16:47:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:47:55,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:47:55,997 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:47:55,997 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:47:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-01-24 16:47:55,997 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:47:55,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:55,998 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:47:55,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:47:55,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:47:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:47:56,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:47:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:47:56,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:47:56,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:47:56,071 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:47:56,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:47:56,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:47:56,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:47:56,072 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-01-24 16:47:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:47:56,124 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-24 16:47:56,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:47:56,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 16:47:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:47:56,124 INFO L225 Difference]: With dead ends: 46 [2018-01-24 16:47:56,124 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:47:56,125 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:47:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:47:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:47:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:47:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:47:56,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 16:47:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:47:56,125 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:47:56,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:47:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:47:56,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:47:56,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:47:56,692 WARN L146 SmtUtils]: Spent 469ms on a formula simplification. DAG size of input: 72 DAG size of output 55 [2018-01-24 16:47:57,028 WARN L146 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 135 DAG size of output 110 [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-24 16:47:57,109 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 16:47:57,110 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-24 16:47:57,110 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 16:47:57,110 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-24 16:47:57,110 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,110 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:47:57,110 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,110 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-24 16:47:57,110 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,110 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 562) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 562) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 16:47:57,111 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 16:47:57,112 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 562) no Hoare annotation was computed. [2018-01-24 16:47:57,112 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:47:57,112 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 16:47:57,112 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 16:47:57,112 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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,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-24 16:47:57,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,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-24 16:47:57,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,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-24 16:47:57,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-24 16:47:57,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,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-24 16:47:57,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,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-24 16:47:57,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,150 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,150 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,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-24 16:47:57,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:47:57 BoogieIcfgContainer [2018-01-24 16:47:57,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:47:57,171 INFO L168 Benchmark]: Toolchain (without parser) took 10746.74 ms. Allocated memory was 306.2 MB in the beginning and 590.3 MB in the end (delta: 284.2 MB). Free memory was 264.9 MB in the beginning and 329.2 MB in the end (delta: -64.2 MB). Peak memory consumption was 219.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:57,172 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:47:57,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.72 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:57,173 INFO L168 Benchmark]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 306.2 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:57,173 INFO L168 Benchmark]: RCFGBuilder took 250.96 ms. Allocated memory is still 306.2 MB. Free memory was 252.8 MB in the beginning and 235.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:57,173 INFO L168 Benchmark]: TraceAbstraction took 10244.79 ms. Allocated memory was 306.2 MB in the beginning and 590.3 MB in the end (delta: 284.2 MB). Free memory was 235.8 MB in the beginning and 329.2 MB in the end (delta: -93.4 MB). Peak memory consumption was 190.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:47:57,175 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.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.72 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 306.2 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 250.96 ms. Allocated memory is still 306.2 MB. Free memory was 252.8 MB in the beginning and 235.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10244.79 ms. Allocated memory was 306.2 MB in the beginning and 590.3 MB in the end (delta: 284.2 MB). Free memory was 235.8 MB in the beginning and 329.2 MB in the end (delta: -93.4 MB). Peak memory consumption was 190.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 191 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.586756 RENAME_VARIABLES(MILLISECONDS) : 0.558404 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.549182 PROJECTAWAY(MILLISECONDS) : 0.305667 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001508 DISJOIN(MILLISECONDS) : 0.369979 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.594048 ADD_EQUALITY(MILLISECONDS) : 0.036264 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016009 #CONJOIN_DISJUNCTIVE : 57 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 192 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.804777 RENAME_VARIABLES(MILLISECONDS) : 0.274779 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.353335 PROJECTAWAY(MILLISECONDS) : 0.057459 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001229 DISJOIN(MILLISECONDS) : 0.620405 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.306121 ADD_EQUALITY(MILLISECONDS) : 0.020822 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016441 #CONJOIN_DISJUNCTIVE : 57 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 91 #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-24 16:47:57,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,202 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,202 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,202 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,202 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:47:57,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 16:47:57,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:47:57,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:47:57,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:47:57,230 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, 10.1s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s 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, 4.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, 0.4s 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.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s 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_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-47-57-235.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-47-57-235.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-47-57-235.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-47-57-235.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-47-57-235.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_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-47-57-235.csv Received shutdown request...