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.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:45:41,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:45:41,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:45:41,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:45:41,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:45:41,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:45:41,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:45:41,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:45:41,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:45:41,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:45:41,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:45:41,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:45:41,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:45:41,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:45:41,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:45:41,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:45:41,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:45:41,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:45:41,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:45:41,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:45:41,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:45:41,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:45:41,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:45:41,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:45:41,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:45:41,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:45:41,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:45:41,519 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:45:41,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:45:41,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:45:41,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:45:41,520 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.epf [2018-01-24 11:45:41,529 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:45:41,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:45:41,530 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:45:41,530 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:45:41,530 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:45:41,530 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:45:41,530 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:45:41,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:45:41,531 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:45:41,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:45:41,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:45:41,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:45:41,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:45:41,532 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:45:41,532 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:45:41,532 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:45:41,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:45:41,532 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:45:41,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:45:41,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:45:41,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:45:41,533 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:45:41,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:45:41,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:45:41,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:45:41,533 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:45:41,534 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:45:41,534 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:45:41,534 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:45:41,534 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:45:41,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:45:41,534 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:45:41,535 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:45:41,535 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:45:41,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:45:41,578 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:45:41,582 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:45:41,583 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:45:41,583 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:45:41,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:45:41,751 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:45:41,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:45:41,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:45:41,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:45:41,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:45:41,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f741a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41, skipping insertion in model container [2018-01-24 11:45:41,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,780 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:45:41,819 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:45:41,930 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:45:41,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:45:41,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41 WrapperNode [2018-01-24 11:45:41,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:45:41,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:45:41,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:45:41,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:45:41,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... [2018-01-24 11:45:41,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:45:41,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:45:41,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:45:41,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:45:41,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:45:42,030 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:45:42,030 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:45:42,030 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 11:45:42,031 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:45:42,031 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:45:42,031 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:45:42,031 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:45:42,031 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:45:42,031 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:45:42,031 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:45:42,032 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 11:45:42,032 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:45:42,032 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:45:42,032 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:45:42,219 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:45:42,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:45:42 BoogieIcfgContainer [2018-01-24 11:45:42,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:45:42,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:45:42,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:45:42,222 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:45:42,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:45:41" (1/3) ... [2018-01-24 11:45:42,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aac6052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:45:42, skipping insertion in model container [2018-01-24 11:45:42,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:41" (2/3) ... [2018-01-24 11:45:42,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aac6052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:45:42, skipping insertion in model container [2018-01-24 11:45:42,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:45:42" (3/3) ... [2018-01-24 11:45:42,225 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:45:42,231 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:45:42,237 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 11:45:42,271 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:45:42,271 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:45:42,271 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:45:42,272 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:45:42,272 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:45:42,272 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:45:42,272 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:45:42,272 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:45:42,273 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:45:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 11:45:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:45:42,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:42,301 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:42,301 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 11:45:42,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:42,309 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:42,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:42,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:42,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:42,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:42,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:45:42,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:45:42,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:45:42,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:45:42,482 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 11:45:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:42,562 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 11:45:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:45:42,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 11:45:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:42,636 INFO L225 Difference]: With dead ends: 57 [2018-01-24 11:45:42,636 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 11:45:42,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 11:45:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 11:45:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 11:45:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 11:45:42,671 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 11:45:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:42,671 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 11:45:42,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:45:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 11:45:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:45:42,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:42,672 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:42,672 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 11:45:42,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:42,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:42,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:42,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:42,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:42,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:42,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:45:42,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:45:42,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:45:42,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:45:42,712 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 11:45:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:42,757 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 11:45:42,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:45:42,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 11:45:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:42,759 INFO L225 Difference]: With dead ends: 40 [2018-01-24 11:45:42,759 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 11:45:42,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:45:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 11:45:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 11:45:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 11:45:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 11:45:42,764 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 11:45:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:42,765 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 11:45:42,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:45:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 11:45:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:45:42,766 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:42,766 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:42,766 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 11:45:42,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:42,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:42,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:42,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:42,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:42,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:42,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:45:42,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:45:42,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:45:42,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:45:42,840 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 11:45:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:42,904 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 11:45:42,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:45:42,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:45:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:42,906 INFO L225 Difference]: With dead ends: 37 [2018-01-24 11:45:42,906 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:45:42,907 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:45:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 11:45:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:45:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:45:42,912 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 11:45:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:42,913 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:45:42,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:45:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:45:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:45:42,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:42,914 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:42,914 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 11:45:42,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:42,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:42,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:42,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:42,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:43,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:43,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:45:43,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:45:43,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:45:43,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:43,043 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 11:45:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:43,114 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 11:45:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:45:43,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:45:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:43,115 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:45:43,115 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 11:45:43,115 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 11:45:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 11:45:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:45:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 11:45:43,121 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 11:45:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:43,121 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 11:45:43,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:45:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 11:45:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 11:45:43,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:43,122 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:43,122 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-01-24 11:45:43,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:43,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:43,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:43,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:43,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:43,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:43,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:45:43,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:45:43,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:45:43,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:43,180 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 11:45:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:43,230 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 11:45:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:45:43,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 11:45:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:43,232 INFO L225 Difference]: With dead ends: 35 [2018-01-24 11:45:43,232 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 11:45:43,232 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 11:45:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 11:45:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 11:45:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 11:45:43,238 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-24 11:45:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:43,238 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 11:45:43,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:45:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 11:45:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 11:45:43,239 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:43,239 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:43,239 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-01-24 11:45:43,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:43,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:43,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:43,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:43,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:43,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:43,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:45:43,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:45:43,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:45:43,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:43,381 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-24 11:45:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:43,470 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 11:45:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:45:43,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 11:45:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:43,474 INFO L225 Difference]: With dead ends: 45 [2018-01-24 11:45:43,474 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 11:45:43,475 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:45:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 11:45:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-24 11:45:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:45:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:45:43,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-24 11:45:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:43,480 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:45:43,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:45:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:45:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:45:43,480 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:43,481 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:43,481 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:43,481 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-01-24 11:45:43,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:43,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:43,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:43,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:43,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:43,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:43,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:45:43,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:45:43,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:45:43,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:43,572 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-24 11:45:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:43,671 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 11:45:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:45:43,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 11:45:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:43,672 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:45:43,672 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 11:45:43,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:45:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 11:45:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 11:45:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:45:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 11:45:43,677 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-24 11:45:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:43,678 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 11:45:43,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:45:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 11:45:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:45:43,679 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:43,679 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:43,679 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-01-24 11:45:43,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:43,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:43,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:43,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:43,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:43,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:43,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:45:43,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:45:43,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:45:43,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:43,783 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-24 11:45:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:43,904 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 11:45:43,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:45:43,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 11:45:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:43,905 INFO L225 Difference]: With dead ends: 42 [2018-01-24 11:45:43,906 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 11:45:43,906 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:45:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 11:45:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-24 11:45:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:45:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:45:43,911 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-24 11:45:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:43,911 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:45:43,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:45:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:45:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:45:43,912 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:43,912 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:43,912 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-01-24 11:45:43,913 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:43,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:43,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:43,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:43,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:44,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:44,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:45:44,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:45:44,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:45:44,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:45:44,055 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-01-24 11:45:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:44,149 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-24 11:45:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:45:44,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 11:45:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:44,150 INFO L225 Difference]: With dead ends: 75 [2018-01-24 11:45:44,150 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 11:45:44,150 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:45:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 11:45:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-24 11:45:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:45:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-24 11:45:44,156 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-01-24 11:45:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:44,156 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-24 11:45:44,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:45:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-24 11:45:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:45:44,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:44,157 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:44,157 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-01-24 11:45:44,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:44,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:44,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:44,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:44,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:44,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:44,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:44,365 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-24 11:45:44,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:44,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:44,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:44,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:44,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:44,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:44,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:44,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:45:44,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 11:45:44,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:44,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:44,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:44,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:44,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 11:45:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:44,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:44,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-01-24 11:45:44,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:45:44,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:45:44,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:45:44,691 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 17 states. [2018-01-24 11:45:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:45,036 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 11:45:45,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:45:45,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-01-24 11:45:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:45,037 INFO L225 Difference]: With dead ends: 66 [2018-01-24 11:45:45,037 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 11:45:45,038 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:45:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 11:45:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-01-24 11:45:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:45:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 11:45:45,079 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-01-24 11:45:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:45,079 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 11:45:45,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:45:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 11:45:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:45:45,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:45,080 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:45,080 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-01-24 11:45:45,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:45,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:45,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:45,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:45,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:45,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:45,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:45,305 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:45,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:45,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:45,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:45,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:45,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:45,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:45,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:45,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 11:45:45,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:45,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:45,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:45,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:45,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:45:45,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:45,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:45,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 11:45:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:45,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:45,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-24 11:45:45,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:45:45,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:45:45,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:45:45,616 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 22 states. [2018-01-24 11:45:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:46,125 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 11:45:46,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:45:46,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-24 11:45:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:46,126 INFO L225 Difference]: With dead ends: 64 [2018-01-24 11:45:46,126 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 11:45:46,126 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:45:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 11:45:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-01-24 11:45:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:45:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-24 11:45:46,135 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2018-01-24 11:45:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:46,136 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-24 11:45:46,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:45:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-24 11:45:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:45:46,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:46,137 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:46,137 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-01-24 11:45:46,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:46,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:46,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:46,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:46,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:46,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:46,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:46,433 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-24 11:45:46,438 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:45:46,454 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:46,461 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:46,464 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:46,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:46,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:46,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:45:46,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:46,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:46,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:46,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,529 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-24 11:45:46,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 11:45:46,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:45:46,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:45:46,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 11:45:46,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 11:45:46,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:45:46,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:46,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:46,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-24 11:45:46,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 11:45:46,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:45:46,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:46,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:46,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:46,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 11:45:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:46,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:46,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-01-24 11:45:46,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 11:45:46,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 11:45:46,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:45:46,862 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 21 states. [2018-01-24 11:45:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:47,527 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-24 11:45:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:45:47,528 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 11:45:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:47,529 INFO L225 Difference]: With dead ends: 63 [2018-01-24 11:45:47,529 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 11:45:47,530 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 11:45:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 11:45:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-01-24 11:45:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:45:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-01-24 11:45:47,539 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2018-01-24 11:45:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:47,539 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-01-24 11:45:47,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 11:45:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-01-24 11:45:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:45:47,540 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:47,541 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:47,541 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:45:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-01-24 11:45:47,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:47,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:47,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:47,542 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:47,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:47,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:47,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:47,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:45:47,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:45:47,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:45:47,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:47,634 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-01-24 11:45:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:47,775 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-24 11:45:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:45:47,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 11:45:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:47,776 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:45:47,777 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:45:47,777 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:45:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:45:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:45:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:45:47,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 11:45:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:47,778 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:45:47,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:45:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:45:47,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:45:47,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:45:48,107 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 75 DAG size of output 52 [2018-01-24 11:45:48,442 WARN L146 SmtUtils]: Spent 330ms on a formula simplification. DAG size of input: 126 DAG size of output 109 [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-24 11:45:48,524 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 11:45:48,525 INFO L397 ceAbstractionStarter]: At program point L544'''''(line 544) the Hoare annotation is: (let ((.cse17 (select |#length| |cstrcpy_#in~from.base|))) (let ((.cse10 (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|)) (.cse0 (< (select |#length| |cstrcpy_#in~to.base|) .cse17)) (.cse6 (<= cstrcpy_~to.offset 0)) (.cse13 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse7 (not (= (select |#valid| |cstrcpy_#in~to.base|) 1))) (.cse8 (not (= 1 (select |#valid| |cstrcpy_#in~from.base|)))) (.cse9 (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))))) (.cse14 (not (= 0 |cstrcpy_#in~from.offset|)))) (and (let ((.cse15 (select |#length| cstrcpy_~from.base)) (.cse16 (select |#length| cstrcpy_~to.base))) (let ((.cse2 (<= .cse15 .cse16)) (.cse1 (= 1 (select |#valid| cstrcpy_~from.base))) (.cse3 (= (select |#valid| cstrcpy_~to.base) 1)) (.cse4 (not (= cstrcpy_~to.base cstrcpy_~from.base))) (.cse11 (<= (+ cstrcpy_~from.offset 1) .cse15)) (.cse5 (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))))))) (.cse12 (<= 1 cstrcpy_~to.offset))) (or .cse0 (and .cse1 .cse2 .cse3 (<= 0 cstrcpy_~to.offset) .cse4 (= cstrcpy_~from.offset 0) .cse5 .cse6 (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))) (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)))) .cse7 .cse8 .cse9 .cse10 (and .cse1 (<= cstrcpy_~to.offset 1) (<= 1 cstrcpy_~from.offset) .cse2 .cse3 .cse4 .cse11 .cse5 .cse12) (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)))) .cse13 .cse14 (and (<= (+ cstrcpy_~to.offset .cse15) (+ .cse16 cstrcpy_~from.offset)) .cse1 .cse3 .cse4 .cse11 .cse5 (<= 2 cstrcpy_~from.offset) .cse12)))) (or .cse10 (not (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|))) .cse0 (and (= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|)) (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) .cse6) .cse13 (< .cse17 1) .cse7 .cse8 .cse9 .cse14)))) [2018-01-24 11:45:48,525 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 11:45:48,525 INFO L397 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 546) the Hoare annotation is: (let ((.cse8 (select |#length| |cstrcpy_#in~from.base|))) (let ((.cse0 (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|)) (.cse1 (< (select |#length| |cstrcpy_#in~to.base|) .cse8)) (.cse2 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse3 (< .cse8 1)) (.cse4 (not (= (select |#valid| |cstrcpy_#in~to.base|) 1))) (.cse5 (not (= 1 (select |#valid| |cstrcpy_#in~from.base|)))) (.cse6 (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))))) (.cse7 (not (= 0 |cstrcpy_#in~from.offset|)))) (and (or .cse0 (not (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|))) .cse1 (= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (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))) .cse5 .cse6 .cse7)))) [2018-01-24 11:45:48,525 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,525 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:45:48,525 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,525 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-24 11:45:48,525 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,525 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 562) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 562) no Hoare annotation was computed. [2018-01-24 11:45:48,526 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 11:45:48,527 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 11:45:48,527 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 562) no Hoare annotation was computed. [2018-01-24 11:45:48,527 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:45:48,527 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 11:45:48,527 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 11:45:48,527 INFO L397 ceAbstractionStarter]: At program point L559'(line 559) the Hoare annotation is: (let ((.cse1 (select |#length| |main_#t~malloc7.base|)) (.cse0 (select |#length| main_~nondetString~4.base))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= .cse0 main_~length2~4) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ main_~nondetString~4.offset .cse0 (- 1)))) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-24 11:45:48,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,569 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,570 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,570 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,570 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,571 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,571 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,571 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,571 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:45:48 BoogieIcfgContainer [2018-01-24 11:45:48,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:45:48,601 INFO L168 Benchmark]: Toolchain (without parser) took 6848.84 ms. Allocated memory was 304.1 MB in the beginning and 542.6 MB in the end (delta: 238.6 MB). Free memory was 263.0 MB in the beginning and 359.7 MB in the end (delta: -96.7 MB). Peak memory consumption was 141.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:48,602 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:45:48,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.14 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 253.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:48,603 INFO L168 Benchmark]: Boogie Preprocessor took 31.12 ms. Allocated memory is still 304.1 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:48,603 INFO L168 Benchmark]: RCFGBuilder took 234.51 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 234.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:48,603 INFO L168 Benchmark]: TraceAbstraction took 6379.90 ms. Allocated memory was 304.1 MB in the beginning and 542.6 MB in the end (delta: 238.6 MB). Free memory was 234.0 MB in the beginning and 359.7 MB in the end (delta: -125.7 MB). Peak memory consumption was 112.9 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:48,605 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.14 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 253.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 31.12 ms. Allocated memory is still 304.1 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 234.51 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 234.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6379.90 ms. Allocated memory was 304.1 MB in the beginning and 542.6 MB in the end (delta: 238.6 MB). Free memory was 234.0 MB in the beginning and 359.7 MB in the end (delta: -125.7 MB). Peak memory consumption was 112.9 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_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[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_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_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[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_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_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] * 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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 11:45:48,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:45:48,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:45:48,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:48,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:48,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:48,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((unknown-#length-unknown[to] < unknown-#length-unknown[from] || (((((((((1 == \valid[from] && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && 0 <= to) && !(to == from)) && from == 0) && (\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])) && to <= 0) && (\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_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))) || !(\valid[to] == 1)) || !(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) || ((((((((1 == \valid[from] && to <= 1) && 1 <= from) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_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])) && 1 <= 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)) || (((((((to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from && 1 == \valid[from]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[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])) && 2 <= from) && 1 <= to)) && (((((((((from == to || !(0 == \old(unknown-#memory_int-unknown)[from][from])) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) || ((0 == unknown-#memory_int-unknown[from][from] && 0 == unknown-#memory_int-unknown[from][from]) && to <= 0)) || !(0 == to)) || unknown-#length-unknown[from] < 1) || !(\valid[to] == 1)) || !(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)) || !(0 == from)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 6.2s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 369 SDtfs, 483 SDslu, 1611 SDs, 0 SdLazy, 1333 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 666 HoareAnnotationTreeSize, 9 FomulaSimplifications, 175 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 670 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 308 ConstructedInterpolants, 13 QuantifiedInterpolants, 52648 SizeOfPredicates, 27 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 2/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-45-48-652.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-45-48-652.csv Received shutdown request...