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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:29:01,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:29:01,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:29:01,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:29:01,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:29:01,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:29:01,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:29:01,635 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:29:01,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:29:01,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:29:01,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:29:01,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:29:01,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:29:01,642 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:29:01,647 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:29:01,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:29:01,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:29:01,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:29:01,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:29:01,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:29:01,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:29:01,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:29:01,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:29:01,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:29:01,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:29:01,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:29:01,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:29:01,678 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:29:01,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:29:01,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:29:01,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:29:01,679 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:29:01,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:29:01,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:29:01,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:29:01,699 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:29:01,699 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:29:01,699 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:29:01,699 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:29:01,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:29:01,700 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:29:01,700 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:29:01,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:29:01,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:29:01,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:29:01,701 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:29:01,701 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:29:01,702 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:29:01,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:29:01,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:29:01,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:29:01,702 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:29:01,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:29:01,703 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:29:01,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:29:01,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:29:01,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:29:01,703 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:29:01,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:29:01,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:29:01,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:29:01,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:29:01,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:29:01,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:29:01,706 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:29:01,706 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:29:01,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:29:01,769 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:29:01,774 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:29:01,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:29:01,779 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:29:01,780 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-31 08:29:02,027 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:29:02,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:29:02,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:29:02,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:29:02,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:29:02,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f4f4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02, skipping insertion in model container [2018-01-31 08:29:02,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,068 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:29:02,128 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:29:02,261 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:29:02,280 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:29:02,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02 WrapperNode [2018-01-31 08:29:02,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:29:02,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:29:02,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:29:02,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:29:02,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (1/1) ... [2018-01-31 08:29:02,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:29:02,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:29:02,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:29:02,335 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:29:02,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (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-31 08:29:02,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:29:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:29:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-31 08:29:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:29:02,410 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:29:02,410 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:29:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:29:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:29:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:29:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:29:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-31 08:29:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:29:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:29:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:29:02,908 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:29:02,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:29:02 BoogieIcfgContainer [2018-01-31 08:29:02,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:29:02,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:29:02,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:29:02,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:29:02,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:29:02" (1/3) ... [2018-01-31 08:29:02,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102f4640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:29:02, skipping insertion in model container [2018-01-31 08:29:02,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:29:02" (2/3) ... [2018-01-31 08:29:02,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102f4640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:29:02, skipping insertion in model container [2018-01-31 08:29:02,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:29:02" (3/3) ... [2018-01-31 08:29:02,915 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:29:02,923 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:29:02,932 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-31 08:29:02,977 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:29:02,977 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:29:02,977 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:29:02,978 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:29:02,978 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:29:02,978 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:29:02,978 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:29:02,978 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:29:02,979 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:29:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-31 08:29:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 08:29:03,010 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:03,011 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:29:03,011 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2131412433, now seen corresponding path program 1 times [2018-01-31 08:29:03,019 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:03,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:03,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:03,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:03,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:03,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:03,266 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-31 08:29:03,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:03,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:29:03,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:29:03,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:29:03,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:29:03,290 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-31 08:29:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:03,463 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-31 08:29:03,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:29:03,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-31 08:29:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:03,572 INFO L225 Difference]: With dead ends: 74 [2018-01-31 08:29:03,572 INFO L226 Difference]: Without dead ends: 55 [2018-01-31 08:29:03,575 INFO L554 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-31 08:29:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-31 08:29:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-31 08:29:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 08:29:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-31 08:29:03,618 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 17 [2018-01-31 08:29:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:03,619 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-31 08:29:03,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:29:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-31 08:29:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:29:03,619 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:03,620 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:29:03,620 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash -52534590, now seen corresponding path program 1 times [2018-01-31 08:29:03,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:03,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:03,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:03,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:03,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:03,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:03,757 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-31 08:29:03,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:03,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:29:03,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:29:03,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:29:03,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:29:03,760 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2018-01-31 08:29:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:04,088 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-01-31 08:29:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:29:04,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 08:29:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:04,090 INFO L225 Difference]: With dead ends: 55 [2018-01-31 08:29:04,090 INFO L226 Difference]: Without dead ends: 54 [2018-01-31 08:29:04,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:29:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-31 08:29:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-31 08:29:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-31 08:29:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-01-31 08:29:04,101 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 20 [2018-01-31 08:29:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:04,101 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-01-31 08:29:04,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:29:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-01-31 08:29:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:29:04,102 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:04,103 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:29:04,103 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:04,103 INFO L82 PathProgramCache]: Analyzing trace with hash -52534589, now seen corresponding path program 1 times [2018-01-31 08:29:04,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:04,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:04,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:04,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:04,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:04,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:04,280 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-31 08:29:04,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:04,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:29:04,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:29:04,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:29:04,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:29:04,283 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2018-01-31 08:29:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:04,364 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-01-31 08:29:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:29:04,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-31 08:29:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:04,366 INFO L225 Difference]: With dead ends: 54 [2018-01-31 08:29:04,366 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 08:29:04,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:29:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 08:29:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-31 08:29:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 08:29:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-31 08:29:04,373 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 20 [2018-01-31 08:29:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:04,374 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-31 08:29:04,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:29:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-31 08:29:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:29:04,375 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:04,375 INFO L351 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] [2018-01-31 08:29:04,375 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -264092111, now seen corresponding path program 1 times [2018-01-31 08:29:04,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:04,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:04,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:04,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:04,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:04,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:04,554 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-31 08:29:04,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:04,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:29:04,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:29:04,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:29:04,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:29:04,555 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2018-01-31 08:29:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:04,671 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-01-31 08:29:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:29:04,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-31 08:29:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:04,673 INFO L225 Difference]: With dead ends: 53 [2018-01-31 08:29:04,673 INFO L226 Difference]: Without dead ends: 52 [2018-01-31 08:29:04,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:29:04,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-31 08:29:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-31 08:29:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-31 08:29:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-31 08:29:04,679 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 26 [2018-01-31 08:29:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:04,680 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-31 08:29:04,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:29:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-31 08:29:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:29:04,681 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:04,681 INFO L351 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] [2018-01-31 08:29:04,681 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash -264092110, now seen corresponding path program 1 times [2018-01-31 08:29:04,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:04,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:04,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:04,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:04,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:04,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:04,869 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-31 08:29:04,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:04,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:29:04,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:29:04,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:29:04,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:29:04,871 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 8 states. [2018-01-31 08:29:05,074 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:29:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:05,308 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-31 08:29:05,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:29:05,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-01-31 08:29:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:05,311 INFO L225 Difference]: With dead ends: 66 [2018-01-31 08:29:05,312 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 08:29:05,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:29:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 08:29:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-01-31 08:29:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-31 08:29:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-01-31 08:29:05,320 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 26 [2018-01-31 08:29:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:05,320 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-01-31 08:29:05,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:29:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-01-31 08:29:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 08:29:05,322 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:05,322 INFO L351 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] [2018-01-31 08:29:05,322 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash 403079131, now seen corresponding path program 1 times [2018-01-31 08:29:05,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:05,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:05,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:05,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:05,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:05,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:05,538 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-31 08:29:05,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:05,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:29:05,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:29:05,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:29:05,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:29:05,540 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 10 states. [2018-01-31 08:29:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:05,752 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-01-31 08:29:05,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:29:05,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-31 08:29:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:05,755 INFO L225 Difference]: With dead ends: 54 [2018-01-31 08:29:05,755 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 08:29:05,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:29:05,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 08:29:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-31 08:29:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 08:29:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-31 08:29:05,762 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 27 [2018-01-31 08:29:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:05,762 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-31 08:29:05,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:29:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-31 08:29:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 08:29:05,763 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:05,764 INFO L351 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] [2018-01-31 08:29:05,764 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:05,764 INFO L82 PathProgramCache]: Analyzing trace with hash 403079132, now seen corresponding path program 1 times [2018-01-31 08:29:05,764 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:05,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:05,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:05,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:05,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:05,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:05,928 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-31 08:29:05,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:05,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:29:05,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:29:05,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:29:05,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:29:05,929 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 8 states. [2018-01-31 08:29:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:06,126 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-31 08:29:06,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:29:06,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-31 08:29:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:06,128 INFO L225 Difference]: With dead ends: 66 [2018-01-31 08:29:06,128 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 08:29:06,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:29:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 08:29:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-01-31 08:29:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-31 08:29:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-01-31 08:29:06,135 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 27 [2018-01-31 08:29:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:06,136 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-01-31 08:29:06,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:29:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-01-31 08:29:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:29:06,137 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:06,137 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:29:06,137 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash -267298687, now seen corresponding path program 1 times [2018-01-31 08:29:06,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:06,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:06,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:06,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:06,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:06,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:06,612 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-31 08:29:06,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:29:06,613 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:29:06,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:06,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:29:06,743 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-31 08:29:06,756 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-31 08:29:06,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:06,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:29:06,773 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-31 08:29:06,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:29:06,995 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-31 08:29:07,003 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-31 08:29:07,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:29:07,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:29:07,031 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-31 08:29:07,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 08:29:07,171 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-31 08:29:07,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:29:07,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-01-31 08:29:07,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:29:07,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:29:07,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:29:07,205 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 17 states. [2018-01-31 08:29:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:08,093 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-31 08:29:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:29:08,093 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-01-31 08:29:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:08,094 INFO L225 Difference]: With dead ends: 79 [2018-01-31 08:29:08,094 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:29:08,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:29:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:29:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-31 08:29:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 08:29:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-31 08:29:08,103 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 37 [2018-01-31 08:29:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:08,104 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-31 08:29:08,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:29:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-31 08:29:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:29:08,105 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:08,105 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:29:08,105 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 303675245, now seen corresponding path program 1 times [2018-01-31 08:29:08,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:08,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:08,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:08,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:08,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:08,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:08,526 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-31 08:29:08,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:29:08,527 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:29:08,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:29:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:08,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:29:08,587 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-31 08:29:08,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:08,661 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-31 08:29:08,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:08,667 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-31 08:29:08,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-31 08:29:08,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:29:08,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:29:08,760 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-31 08:29:08,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:08,768 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-31 08:29:08,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:08,776 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-31 08:29:08,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-31 08:29:09,118 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-31 08:29:09,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:29:09,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-31 08:29:09,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:29:09,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:29:09,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:29:09,139 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 26 states. [2018-01-31 08:29:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:09,988 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-31 08:29:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:29:09,988 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-01-31 08:29:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:09,989 INFO L225 Difference]: With dead ends: 81 [2018-01-31 08:29:09,989 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:29:09,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 08:29:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:29:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2018-01-31 08:29:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 08:29:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-31 08:29:10,000 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 38 [2018-01-31 08:29:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:10,000 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-31 08:29:10,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:29:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-31 08:29:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:29:10,002 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:10,002 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:29:10,002 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash -231889037, now seen corresponding path program 1 times [2018-01-31 08:29:10,002 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:10,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:10,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:10,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:10,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:10,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:10,161 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-31 08:29:10,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:29:10,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:29:10,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:29:10,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:29:10,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:29:10,162 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 6 states. [2018-01-31 08:29:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:10,268 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-31 08:29:10,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:29:10,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-31 08:29:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:10,272 INFO L225 Difference]: With dead ends: 65 [2018-01-31 08:29:10,272 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 08:29:10,273 INFO L554 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-31 08:29:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 08:29:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-31 08:29:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 08:29:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-31 08:29:10,280 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 39 [2018-01-31 08:29:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:10,280 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-31 08:29:10,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:29:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-31 08:29:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-31 08:29:10,281 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:10,282 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-31 08:29:10,282 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 643108562, now seen corresponding path program 2 times [2018-01-31 08:29:10,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:10,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:10,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:10,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:29:10,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:10,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:29:10,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:29:10,712 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:29:10,717 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:29:10,734 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:29:10,753 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:29:10,762 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:29:10,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:29:10,771 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-31 08:29:10,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:29:10,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:29:10,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:29:10,781 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-31 08:29:10,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-01-31 08:29:10,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-31 08:29:10,832 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-31 08:29:10,833 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-31 08:29:10,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:29:10,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-31 08:29:11,138 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-31 08:29:11,150 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-31 08:29:11,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:11,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:29:11,310 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-31 08:29:11,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-31 08:29:11,409 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-31 08:29:11,470 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-31 08:29:11,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:29:11,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:29:11,482 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-31 08:29:11,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-31 08:29:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:29:11,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:29:11,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2018-01-31 08:29:11,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:29:11,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:29:11,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:29:11,573 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 26 states. [2018-01-31 08:29:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:12,756 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-31 08:29:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:29:12,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-01-31 08:29:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:12,757 INFO L225 Difference]: With dead ends: 57 [2018-01-31 08:29:12,757 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 08:29:12,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:29:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 08:29:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-01-31 08:29:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-31 08:29:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-31 08:29:12,765 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2018-01-31 08:29:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:12,766 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-31 08:29:12,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:29:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-31 08:29:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-31 08:29:12,767 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:29:12,767 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-31 08:29:12,767 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:29:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1538471108, now seen corresponding path program 2 times [2018-01-31 08:29:12,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:29:12,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:29:12,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:12,769 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:29:12,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:29:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:29:12,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:29:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:29:13,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:29:13,610 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:29:13,615 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:29:13,629 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:29:13,637 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:29:13,639 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:29:13,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:29:13,666 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-31 08:29:13,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:13,746 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-31 08:29:13,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:13,751 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-31 08:29:13,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-31 08:29:13,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:29:13,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:29:13,780 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-31 08:29:13,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:13,795 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-31 08:29:13,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:29:13,802 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-31 08:29:13,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-31 08:29:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:29:14,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:29:14,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-31 08:29:14,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:29:14,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:29:14,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:29:14,095 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-01-31 08:29:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:29:15,236 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-01-31 08:29:15,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:29:15,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-01-31 08:29:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:29:15,237 INFO L225 Difference]: With dead ends: 70 [2018-01-31 08:29:15,237 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:29:15,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:29:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:29:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:29:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:29:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:29:15,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-31 08:29:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:29:15,239 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:29:15,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:29:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:29:15,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:29:15,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:29:16,595 WARN L146 SmtUtils]: Spent 1228ms on a formula simplification. DAG size of input: 129 DAG size of output 107 [2018-01-31 08:29:16,911 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-01-31 08:29:16,914 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point L544'''''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 546) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point L544''''''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,915 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,916 INFO L399 ceAbstractionStarter]: For program point L544''''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,916 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,916 INFO L395 ceAbstractionStarter]: At program point L544''''''''''''(line 544) the Hoare annotation is: (let ((.cse9 (select |#length| cstrcpy_~from.base)) (.cse4 (select |#length| cstrcpy_~to.base))) (let ((.cse0 (select |#length| |cstrcpy_#in~from.base|)) (.cse3 (<= .cse9 .cse4)) (.cse8 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 1) cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| cstrcpy_~from.base) (- 1))))))) (.cse1 (= 1 (select |#valid| cstrcpy_~from.base))) (.cse5 (= (select |#valid| cstrcpy_~to.base) 1)) (.cse6 (not (= cstrcpy_~to.base cstrcpy_~from.base))) (.cse10 (<= (+ cstrcpy_~from.offset 1) .cse9)) (.cse2 (not (= cstrcpy_~to.base |cstrcpy_#in~from.base|))) (.cse7 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2))))) (or (not (= (select |#valid| |cstrcpy_#in~to.base|) 1)) (< (select |#length| |cstrcpy_#in~to.base|) .cse0) (and .cse1 (= cstrcpy_~from.offset 0) .cse2 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_1 Int) (main_~length2~4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4) (select |#length| cstrcpy_~from.base)) (<= 1 main_~length2~4) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4 (- 1)))) (<= cstrcpy_~from.offset v_main_~nondetString~4.offset_BEFORE_CALL_1))) (= cstrcpy_~to.offset 0) .cse3 (<= .cse0 .cse4) .cse5 .cse6 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| cstrcpy_~from.base) (- 1)))))) .cse7) (and .cse8 .cse1 (<= cstrcpy_~to.offset 1) (or (<= (+ cstrcpy_~from.offset 2) .cse9) (= 1 cstrcpy_~from.offset)) .cse3 .cse5 .cse6 .cse10 .cse2 .cse7 (<= 1 cstrcpy_~to.offset)) (and .cse8 (<= (+ cstrcpy_~to.offset .cse9) (+ .cse4 cstrcpy_~from.offset)) .cse1 (<= 2 cstrcpy_~to.offset) .cse5 .cse6 .cse10 .cse2 (<= 2 cstrcpy_~from.offset) .cse7) (not (= 1 (select |#valid| |cstrcpy_#in~from.base|))) (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1)))) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2)))) (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|) (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_1 Int) (main_~length2~4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4) (select |#length| |cstrcpy_#in~from.base|)) (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_1) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4 (- 1))) 0) (<= 1 main_~length2~4)))) (not (= 0 |cstrcpy_#in~to.offset|)) (not (= 0 |cstrcpy_#in~from.offset|))))) [2018-01-31 08:29:16,916 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,916 INFO L399 ceAbstractionStarter]: For program point L544'''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L395 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 546) the Hoare annotation is: (let ((.cse0 (select |#length| |cstrcpy_#in~from.base|))) (or (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|) (not (= (select |#valid| |cstrcpy_#in~to.base|) 1)) (< (select |#length| |cstrcpy_#in~to.base|) .cse0) (not (= 0 |cstrcpy_#in~to.offset|)) (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2))) (< .cse0 1) (not (= 1 (select |#valid| |cstrcpy_#in~from.base|))) (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1)))) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2)))) (not (= 0 |cstrcpy_#in~from.offset|)))) [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,917 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:29:16,917 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 562) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-31 08:29:16,918 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-31 08:29:16,919 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 547 562) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 547 562) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 547 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-31 08:29:16,920 INFO L395 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|) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= |old(#valid)| (store (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc7.base| 0)) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= main_~length2~4 .cse0) (= 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-31 08:29:16,920 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-31 08:29:16,930 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:16,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:16,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:16,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:16,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:16,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:29:16 BoogieIcfgContainer [2018-01-31 08:29:16,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:29:16,996 INFO L168 Benchmark]: Toolchain (without parser) took 14968.35 ms. Allocated memory was 306.2 MB in the beginning and 579.9 MB in the end (delta: 273.7 MB). Free memory was 264.9 MB in the beginning and 498.6 MB in the end (delta: -233.7 MB). Peak memory consumption was 205.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:16,997 INFO L168 Benchmark]: CDTParser took 0.18 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-31 08:29:16,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.43 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 255.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:17,000 INFO L168 Benchmark]: Boogie Preprocessor took 43.73 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:17,000 INFO L168 Benchmark]: RCFGBuilder took 574.04 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 234.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:17,000 INFO L168 Benchmark]: TraceAbstraction took 14086.47 ms. Allocated memory was 306.2 MB in the beginning and 579.9 MB in the end (delta: 273.7 MB). Free memory was 234.0 MB in the beginning and 498.6 MB in the end (delta: -264.6 MB). Peak memory consumption was 174.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:17,002 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.18 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 252.43 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 255.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.73 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 574.04 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 234.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14086.47 ms. Allocated memory was 306.2 MB in the beginning and 579.9 MB in the end (delta: 273.7 MB). Free memory was 234.0 MB in the beginning and 498.6 MB in the end (delta: -264.6 MB). Peak memory consumption was 174.3 MB. Max. memory is 5.3 GB. * 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_1,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_1,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_1,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[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[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[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[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[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[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[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[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[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[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[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[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[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[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,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_1,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_1,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[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[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[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[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[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[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[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[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[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[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[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[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[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[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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-31 08:29:17,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,051 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,051 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,056 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:29:17,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:29:17,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:29:17,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:29:17,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:29:17,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((!(\valid[to] == 1) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) || ((((((((((1 == \valid[from] && from == 0) && !(to == from)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_1 : int, main_~length2~4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 <= unknown-#length-unknown[from] && 1 <= main_~length2~4) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 + -1]) && from <= v_main_~nondetString~4.offset_BEFORE_CALL_1)) && to == 0) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && !(to == from)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1])) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2))) || (((((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 + 1 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1]) && 1 == \valid[from]) && to <= 1) && (from + 2 <= unknown-#length-unknown[from] || 1 == from)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && !(to == from)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2)) && 1 <= to)) || ((((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 + 1 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1]) && to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from) && 1 == \valid[from]) && 2 <= to) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && !(to == from)) && 2 <= from) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2))) || !(1 == \valid[from])) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && 0 == \old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1]) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2)) || from == to) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_1 : int, main_~length2~4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 <= unknown-#length-unknown[from] && from <= v_main_~nondetString~4.offset_BEFORE_CALL_1) && \old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 + -1] == 0) && 1 <= main_~length2~4)) || !(0 == to)) || !(0 == from) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 7 error locations. SAFE Result, 13.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 517 SDtfs, 940 SDslu, 2863 SDs, 0 SdLazy, 2042 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 55 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 568 HoareAnnotationTreeSize, 7 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 487 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 530 ConstructedInterpolants, 24 QuantifiedInterpolants, 184494 SizeOfPredicates, 41 NumberOfNonLiveVariables, 568 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 3/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-29-17-079.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-29-17-079.csv Received shutdown request...