java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:01:11,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:01:11,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:01:11,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:01:11,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:01:11,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:01:11,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:01:11,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:01:11,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:01:11,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:01:11,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:01:11,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:01:11,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:01:11,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:01:11,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:01:11,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:01:11,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:01:11,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:01:11,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:01:11,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:01:11,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:01:11,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:01:11,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:01:11,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:01:11,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:01:11,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:01:11,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:01:11,485 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:01:11,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:01:11,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:01:11,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:01:11,487 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:01:11,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:01:11,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:01:11,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:01:11,498 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:01:11,499 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:01:11,499 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:01:11,499 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:01:11,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:01:11,500 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:01:11,500 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:01:11,500 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:01:11,500 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:01:11,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:01:11,501 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:01:11,501 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:01:11,501 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:01:11,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:01:11,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:01:11,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:01:11,502 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:01:11,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:01:11,502 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:01:11,503 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:01:11,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:01:11,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:01:11,503 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:01:11,504 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:01:11,504 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:01:11,504 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:01:11,504 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:01:11,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:01:11,504 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:01:11,505 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:01:11,506 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:01:11,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:01:11,557 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:01:11,562 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:01:11,564 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:01:11,565 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:01:11,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:01:11,734 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:01:11,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:01:11,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:01:11,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:01:11,745 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:01:11,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3909789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11, skipping insertion in model container [2018-01-28 21:01:11,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,765 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:01:11,804 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:01:11,915 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:01:11,936 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:01:11,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11 WrapperNode [2018-01-28 21:01:11,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:01:11,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:01:11,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:01:11,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:01:11,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:11,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (1/1) ... [2018-01-28 21:01:12,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:01:12,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:01:12,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:01:12,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:01:12,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (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-28 21:01:12,054 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:01:12,054 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:01:12,054 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-28 21:01:12,054 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:01:12,054 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:01:12,055 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:01:12,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:01:12,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:01:12,055 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:01:12,055 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:01:12,055 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-28 21:01:12,056 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:01:12,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:01:12,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:01:12,253 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:01:12,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:01:12 BoogieIcfgContainer [2018-01-28 21:01:12,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:01:12,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:01:12,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:01:12,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:01:12,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:01:11" (1/3) ... [2018-01-28 21:01:12,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f6295d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:01:12, skipping insertion in model container [2018-01-28 21:01:12,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:11" (2/3) ... [2018-01-28 21:01:12,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f6295d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:01:12, skipping insertion in model container [2018-01-28 21:01:12,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:01:12" (3/3) ... [2018-01-28 21:01:12,259 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:01:12,267 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:01:12,272 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-28 21:01:12,309 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:01:12,310 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:01:12,310 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:01:12,310 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:01:12,310 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:01:12,310 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:01:12,310 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:01:12,311 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:01:12,311 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:01:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-28 21:01:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-28 21:01:12,337 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:12,339 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:12,339 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash -513132750, now seen corresponding path program 1 times [2018-01-28 21:01:12,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:12,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:12,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:12,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:12,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:12,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:12,510 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-28 21:01:12,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:12,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:01:12,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:01:12,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:01:12,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:01:12,527 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-28 21:01:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:12,619 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-28 21:01:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:01:12,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-28 21:01:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:12,633 INFO L225 Difference]: With dead ends: 77 [2018-01-28 21:01:12,633 INFO L226 Difference]: Without dead ends: 58 [2018-01-28 21:01:12,705 INFO L533 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-28 21:01:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-28 21:01:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-28 21:01:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-28 21:01:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-28 21:01:12,736 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 17 [2018-01-28 21:01:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:12,736 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-28 21:01:12,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:01:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-28 21:01:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:01:12,737 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:12,737 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:12,737 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash -890392958, now seen corresponding path program 1 times [2018-01-28 21:01:12,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:12,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:12,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:12,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:12,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:12,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:12,796 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-28 21:01:12,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:12,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:01:12,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:01:12,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:01:12,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:01:12,799 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 4 states. [2018-01-28 21:01:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:12,961 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-01-28 21:01:12,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:01:12,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:01:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:12,963 INFO L225 Difference]: With dead ends: 58 [2018-01-28 21:01:12,963 INFO L226 Difference]: Without dead ends: 57 [2018-01-28 21:01:12,964 INFO L533 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-28 21:01:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-28 21:01:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-28 21:01:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-28 21:01:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-28 21:01:12,971 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 20 [2018-01-28 21:01:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:12,972 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-28 21:01:12,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:01:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-28 21:01:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:01:12,973 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:12,973 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:12,973 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:12,973 INFO L82 PathProgramCache]: Analyzing trace with hash -890392957, now seen corresponding path program 1 times [2018-01-28 21:01:12,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:12,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:12,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:12,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:12,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:12,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:13,114 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-28 21:01:13,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:13,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:01:13,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:01:13,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:01:13,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:01:13,115 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2018-01-28 21:01:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:13,178 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-28 21:01:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:01:13,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 21:01:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:13,180 INFO L225 Difference]: With dead ends: 57 [2018-01-28 21:01:13,180 INFO L226 Difference]: Without dead ends: 56 [2018-01-28 21:01:13,181 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:01:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-28 21:01:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-28 21:01:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-28 21:01:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-28 21:01:13,188 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 20 [2018-01-28 21:01:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:13,188 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-28 21:01:13,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:01:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-28 21:01:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 21:01:13,190 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:13,190 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:13,190 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1042226020, now seen corresponding path program 1 times [2018-01-28 21:01:13,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:13,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:13,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:13,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:13,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:13,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:13,358 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-28 21:01:13,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:13,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:01:13,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:01:13,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:01:13,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:01:13,421 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-01-28 21:01:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:13,641 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-01-28 21:01:13,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:01:13,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-28 21:01:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:13,643 INFO L225 Difference]: With dead ends: 56 [2018-01-28 21:01:13,643 INFO L226 Difference]: Without dead ends: 55 [2018-01-28 21:01:13,643 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:01:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-28 21:01:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-28 21:01:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-28 21:01:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-28 21:01:13,652 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-01-28 21:01:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:13,652 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-28 21:01:13,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:01:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-28 21:01:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 21:01:13,654 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:13,654 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:13,654 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:13,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1042226019, now seen corresponding path program 1 times [2018-01-28 21:01:13,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:13,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:13,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:13,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:13,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:13,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:13,847 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-28 21:01:13,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:13,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:01:13,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:01:13,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:01:13,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:01:13,849 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 10 states. [2018-01-28 21:01:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:14,086 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-01-28 21:01:14,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:01:14,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-28 21:01:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:14,088 INFO L225 Difference]: With dead ends: 70 [2018-01-28 21:01:14,088 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 21:01:14,089 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:01:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 21:01:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-28 21:01:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 21:01:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-28 21:01:14,104 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 31 [2018-01-28 21:01:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:14,106 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-28 21:01:14,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:01:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-28 21:01:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:01:14,108 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:14,108 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:14,108 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2050731734, now seen corresponding path program 1 times [2018-01-28 21:01:14,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:14,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:14,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:14,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:14,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:14,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:14,211 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-28 21:01:14,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:14,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:01:14,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:01:14,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:01:14,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:01:14,212 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 10 states. [2018-01-28 21:01:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:14,396 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-01-28 21:01:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:01:14,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-28 21:01:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:14,398 INFO L225 Difference]: With dead ends: 61 [2018-01-28 21:01:14,398 INFO L226 Difference]: Without dead ends: 60 [2018-01-28 21:01:14,399 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:01:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-28 21:01:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-28 21:01:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-28 21:01:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-28 21:01:14,406 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2018-01-28 21:01:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:14,406 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-28 21:01:14,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:01:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-28 21:01:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:01:14,408 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:14,408 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:14,408 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2050731735, now seen corresponding path program 1 times [2018-01-28 21:01:14,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:14,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:14,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:14,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:14,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:14,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:14,581 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-28 21:01:14,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:14,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:01:14,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:01:14,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:01:14,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:01:14,583 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-01-28 21:01:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:14,900 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-28 21:01:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:01:14,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-28 21:01:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:14,902 INFO L225 Difference]: With dead ends: 65 [2018-01-28 21:01:14,902 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 21:01:14,902 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:01:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 21:01:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-28 21:01:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 21:01:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-28 21:01:14,910 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 32 [2018-01-28 21:01:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:14,910 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-28 21:01:14,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:01:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-28 21:01:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 21:01:14,911 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:14,911 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:14,911 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1511731197, now seen corresponding path program 1 times [2018-01-28 21:01:14,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:14,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:14,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:14,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:14,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:14,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:15,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:15,200 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-28 21:01:15,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:15,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:15,327 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-28 21:01:15,346 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-28 21:01:15,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:15,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:15,354 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-28 21:01:15,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:01:15,847 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-28 21:01:15,863 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-28 21:01:15,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:01:15,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:15,890 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-28 21:01:15,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-28 21:01:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:15,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:15,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-28 21:01:15,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 21:01:15,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 21:01:15,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:01:15,963 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 21 states. [2018-01-28 21:01:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:16,717 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-28 21:01:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:01:16,717 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-01-28 21:01:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:16,718 INFO L225 Difference]: With dead ends: 82 [2018-01-28 21:01:16,718 INFO L226 Difference]: Without dead ends: 81 [2018-01-28 21:01:16,719 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:01:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-28 21:01:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2018-01-28 21:01:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 21:01:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-01-28 21:01:16,728 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 42 [2018-01-28 21:01:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:16,729 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-01-28 21:01:16,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 21:01:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-01-28 21:01:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:01:16,730 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:16,731 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:16,731 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash -380973193, now seen corresponding path program 1 times [2018-01-28 21:01:16,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:16,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:16,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:16,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:16,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:16,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:17,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:17,265 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-28 21:01:17,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:17,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:17,312 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-28 21:01:17,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:17,329 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-28 21:01:17,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:17,335 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-28 21:01:17,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-28 21:01:17,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:17,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:17,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-28 21:01:17,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:17,404 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-28 21:01:17,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:17,410 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-28 21:01:17,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-28 21:01:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:18,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:18,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2018-01-28 21:01:18,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-28 21:01:18,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-28 21:01:18,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1470, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:01:18,091 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 40 states. [2018-01-28 21:01:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:19,848 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-28 21:01:19,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 21:01:19,848 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2018-01-28 21:01:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:19,851 INFO L225 Difference]: With dead ends: 82 [2018-01-28 21:01:19,851 INFO L226 Difference]: Without dead ends: 81 [2018-01-28 21:01:19,852 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=348, Invalid=3192, Unknown=0, NotChecked=0, Total=3540 [2018-01-28 21:01:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-28 21:01:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-01-28 21:01:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 21:01:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-28 21:01:19,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 43 [2018-01-28 21:01:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:19,863 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-28 21:01:19,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-28 21:01:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-28 21:01:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:01:19,864 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:19,865 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:19,865 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1418567855, now seen corresponding path program 1 times [2018-01-28 21:01:19,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:19,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:19,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:19,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:19,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:20,022 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-28 21:01:20,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:20,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:01:20,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:01:20,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:01:20,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:01:20,024 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2018-01-28 21:01:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:20,166 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-28 21:01:20,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:01:20,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-28 21:01:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:20,167 INFO L225 Difference]: With dead ends: 72 [2018-01-28 21:01:20,167 INFO L226 Difference]: Without dead ends: 58 [2018-01-28 21:01:20,167 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:01:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-28 21:01:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-28 21:01:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-28 21:01:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-28 21:01:20,175 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 46 [2018-01-28 21:01:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:20,175 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-28 21:01:20,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:01:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-28 21:01:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:01:20,176 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:20,176 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:20,176 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:20,176 INFO L82 PathProgramCache]: Analyzing trace with hash 665979037, now seen corresponding path program 2 times [2018-01-28 21:01:20,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:20,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:20,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:20,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:20,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:20,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:20,814 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-28 21:01:20,819 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:01:20,832 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:20,838 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:20,840 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:01:20,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:20,874 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-28 21:01:20,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:20,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:20,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:01:20,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:20,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:20,933 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-28 21:01:20,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:20,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:20,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 21:01:20,982 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 14 treesize of output 11 [2018-01-28 21:01:20,984 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-28 21:01:20,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:20,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:20,991 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-28 21:01:20,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 21:01:21,482 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 31 treesize of output 32 [2018-01-28 21:01:21,484 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-28 21:01:21,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:21,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:21,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-28 21:01:21,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:49 [2018-01-28 21:01:21,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-28 21:01:21,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:21,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-01-28 21:01:21,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:01:21,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-28 21:01:21,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:21,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-28 21:01:21,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:21,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:21,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:21,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-01-28 21:01:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:22,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:22,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2018-01-28 21:01:22,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-28 21:01:22,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-28 21:01:22,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1627, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 21:01:22,077 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 42 states. [2018-01-28 21:01:23,115 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 89 DAG size of output 76 [2018-01-28 21:01:23,654 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 104 DAG size of output 92 [2018-01-28 21:01:23,875 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 98 DAG size of output 76 [2018-01-28 21:01:24,141 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 112 DAG size of output 83 [2018-01-28 21:01:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:26,025 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-01-28 21:01:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-28 21:01:26,026 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 53 [2018-01-28 21:01:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:26,026 INFO L225 Difference]: With dead ends: 74 [2018-01-28 21:01:26,027 INFO L226 Difference]: Without dead ends: 73 [2018-01-28 21:01:26,028 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=359, Invalid=3930, Unknown=1, NotChecked=0, Total=4290 [2018-01-28 21:01:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-28 21:01:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-28 21:01:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-28 21:01:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-01-28 21:01:26,034 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2018-01-28 21:01:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:26,035 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-01-28 21:01:26,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-28 21:01:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-01-28 21:01:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 21:01:26,036 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:26,036 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:26,036 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash -829486377, now seen corresponding path program 2 times [2018-01-28 21:01:26,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:26,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:26,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:26,037 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:01:26,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:26,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:26,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:26,617 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:01:26,628 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:01:26,645 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:26,653 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:26,656 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:01:26,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:26,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:01:26,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:26,690 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-28 21:01:26,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:26,741 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-28 21:01:26,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-28 21:01:26,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:26,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:26,804 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-28 21:01:26,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:26,814 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-28 21:01:26,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:26,820 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-28 21:01:26,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-28 21:01:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:27,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:27,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-01-28 21:01:27,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-28 21:01:27,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-28 21:01:27,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2235, Unknown=0, NotChecked=0, Total=2352 [2018-01-28 21:01:27,582 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 49 states. [2018-01-28 21:01:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:30,516 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-01-28 21:01:30,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-28 21:01:30,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 54 [2018-01-28 21:01:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:30,517 INFO L225 Difference]: With dead ends: 71 [2018-01-28 21:01:30,517 INFO L226 Difference]: Without dead ends: 70 [2018-01-28 21:01:30,519 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=634, Invalid=5686, Unknown=0, NotChecked=0, Total=6320 [2018-01-28 21:01:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-28 21:01:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-28 21:01:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 21:01:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-01-28 21:01:30,524 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 54 [2018-01-28 21:01:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:30,525 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-01-28 21:01:30,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-28 21:01:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-01-28 21:01:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-28 21:01:30,525 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:30,525 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-28 21:01:30,526 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:01:30,526 INFO L82 PathProgramCache]: Analyzing trace with hash -756315139, now seen corresponding path program 3 times [2018-01-28 21:01:30,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:30,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:30,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:30,526 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:01:30,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:30,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:01:31,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:31,114 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:01:31,123 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:01:31,139 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:01:31,145 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:01:31,149 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:01:31,154 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:01:31,158 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:01:31,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:31,180 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-28 21:01:31,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:01:31,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:01:31,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:31,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:31,198 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-28 21:01:31,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:01:31,245 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-28 21:01:31,246 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-28 21:01:31,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,252 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-28 21:01:31,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:01:31,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-28 21:01:31,390 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-28 21:01:31,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 21:01:31,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-28 21:01:31,443 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-28 21:01:31,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:31,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 21:01:31,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-28 21:01:31,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-28 21:01:31,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:01:31,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:31,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:31,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-28 21:01:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-28 21:01:31,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:31,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 31 [2018-01-28 21:01:31,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 21:01:31,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 21:01:31,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:01:31,600 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 32 states. [2018-01-28 21:01:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:32,516 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-28 21:01:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:01:32,517 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-01-28 21:01:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:32,517 INFO L225 Difference]: With dead ends: 67 [2018-01-28 21:01:32,517 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:01:32,519 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=2413, Unknown=0, NotChecked=0, Total=2862 [2018-01-28 21:01:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:01:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:01:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:01:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:01:32,523 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-01-28 21:01:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:32,523 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:01:32,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 21:01:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:01:32,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:01:32,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:01:34,011 WARN L146 SmtUtils]: Spent 1352ms on a formula simplification. DAG size of input: 85 DAG size of output 37 [2018-01-28 21:01:34,628 WARN L146 SmtUtils]: Spent 613ms on a formula simplification. DAG size of input: 207 DAG size of output 115 [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L544'''''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-28 21:01:34,710 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-28 21:01:34,711 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,711 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,711 INFO L395 ceAbstractionStarter]: At program point L544''''''''''''''(lines 544 545) the Hoare annotation is: (let ((.cse22 (select |#memory_int| cstrcpy_~src~2.base)) (.cse7 (select |#length| cstrcpy_~src~2.base)) (.cse8 (select |#length| cstrcpy_~dst~2.base)) (.cse20 (select |#length| cstrcpy_~s2.base)) (.cse24 (select |#length| cstrcpy_~s1.base)) (.cse23 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse19 (+ .cse23 (- 1))) (.cse0 (not (= cstrcpy_~s1.base cstrcpy_~s2.base))) (.cse1 (= 0 cstrcpy_~s2.offset)) (.cse2 (<= .cse23 .cse24)) (.cse3 (= 1 (select |#valid| cstrcpy_~s1.base))) (.cse5 (not (= cstrcpy_~s1.base |cstrcpy_#in~s2.base|))) (.cse6 (<= .cse20 .cse24)) (.cse9 (= 0 cstrcpy_~s1.offset)) (.cse10 (= 0 (select (select |#memory_int| cstrcpy_~s2.base) (+ .cse20 (- 1))))) (.cse11 (= 1 (select |#valid| cstrcpy_~src~2.base))) (.cse21 (<= .cse7 .cse8)) (.cse12 (not (= cstrcpy_~dst~2.base cstrcpy_~s2.base))) (.cse4 (<= 1 cstrcpy_~src~2.offset)) (.cse13 (<= 1 .cse20)) (.cse14 (not (= cstrcpy_~dst~2.base cstrcpy_~src~2.base))) (.cse15 (= 0 (select .cse22 (+ .cse7 (- 1))))) (.cse16 (<= (+ cstrcpy_~src~2.offset 1) .cse7)) (.cse17 (= 1 (select |#valid| cstrcpy_~dst~2.base))) (.cse18 (= 1 (select |#valid| cstrcpy_~s2.base)))) (or (and .cse0 .cse1 .cse2 (<= 2 cstrcpy_~dst~2.offset) .cse3 .cse4 .cse5 .cse6 (<= (+ cstrcpy_~dst~2.offset .cse7) (+ cstrcpy_~src~2.offset .cse8)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1)) (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|) (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|))) (not (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) .cse19))) (not (= 0 |cstrcpy_#in~s1.offset|)) (and .cse0 .cse1 .cse2 (= 0 cstrcpy_~dst~2.offset) (= 0 cstrcpy_~src~2.offset) .cse3 (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) .cse19)) .cse5 .cse6 (<= .cse20 .cse8) .cse9 .cse10 .cse11 .cse21 .cse12 (<= 1 .cse7) .cse13 .cse14 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 (<= cstrcpy_~dst~2.offset 1) .cse3 (exists ((|cstrcpy_#t~post0.offset| Int) (|cstrcpy_#t~post0.base| Int)) (and (= (select (select |#memory_int| |cstrcpy_#t~post0.base|) |cstrcpy_#t~post0.offset|) (select (select |#memory_int| cstrcpy_~src~2.base) (+ cstrcpy_~src~2.offset (- 1)))) (not (= cstrcpy_~src~2.base |cstrcpy_#t~post0.base|)))) .cse5 (not (= 0 (select .cse22 (+ cstrcpy_~src~2.offset (- 1))))) .cse6 .cse9 .cse10 (<= 1 cstrcpy_~dst~2.offset) .cse11 .cse21 .cse12 (or (and (<= (+ cstrcpy_~src~2.offset 2) .cse7) .cse4) (and (<= cstrcpy_~src~2.offset 1) .cse4)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (not (= 0 |cstrcpy_#in~s2.offset|)) (< (select |#length| |cstrcpy_#in~s1.base|) .cse23) (< .cse23 1)))) [2018-01-28 21:01:34,711 INFO L399 ceAbstractionStarter]: For program point L544''''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,711 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,711 INFO L399 ceAbstractionStarter]: For program point L544''''''''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,711 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point L544'''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''''''(lines 544 545) no Hoare annotation was computed. [2018-01-28 21:01:34,712 INFO L395 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 547) the Hoare annotation is: (let ((.cse1 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse0 (+ .cse1 (- 1)))) (or (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) .cse0)) (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1)) (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|) (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|))) (not (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) .cse0))) (not (= 0 |cstrcpy_#in~s1.offset|)) (not (= 0 |cstrcpy_#in~s2.offset|)) (< (select |#length| |cstrcpy_#in~s1.base|) .cse1) (< .cse1 1)))) [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 563) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-28 21:01:34,713 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L559'''(line 559) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L559''(line 559) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L395 ceAbstractionStarter]: At program point L560'(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 main_~nondetArea~3.offset) (= 0 |main_#t~malloc6.offset|) (not (= main_~nondetArea~3.base main_~nondetString~3.base)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~3 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~3.base |main_#t~malloc7.base|)) (= 1 (select |#valid| main_~nondetArea~3.base)) (<= main_~length2~3 main_~length1~3) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ .cse0 (+ main_~nondetString~3.offset (- 1))))) (= 0 |main_#t~malloc7.offset|) (= main_~length2~3 (select |#length| |main_#t~malloc7.base|)) (= main_~length2~3 .cse0) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= 0 main_~nondetString~3.offset) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (<= 1 main_~length2~3) (= (select |#valid| |main_#t~malloc6.base|) 1) (<= .cse0 (select |#length| main_~nondetArea~3.base)))) [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-28 21:01:34,714 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 548 563) no Hoare annotation was computed. [2018-01-28 21:01:34,715 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-28 21:01:34,715 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-28 21:01:34,715 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-28 21:01:34,715 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 548 563) no Hoare annotation was computed. [2018-01-28 21:01:34,715 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 548 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:01:34,715 INFO L399 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-28 21:01:34,715 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-28 21:01:34,715 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-28 21:01:34,727 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,728 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-28 21:01:34,729 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,735 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,735 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,735 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,735 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,735 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,736 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,736 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,736 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,736 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,751 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,751 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-28 21:01:34,752 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,756 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,756 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,756 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,756 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,757 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,757 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,757 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,757 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:01:34 BoogieIcfgContainer [2018-01-28 21:01:34,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:01:34,769 INFO L168 Benchmark]: Toolchain (without parser) took 23034.94 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 266.6 MB in the beginning and 468.0 MB in the end (delta: -201.4 MB). Peak memory consumption was 233.5 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:34,771 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 307.8 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:01:34,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.68 ms. Allocated memory is still 307.8 MB. Free memory was 266.6 MB in the beginning and 256.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:34,771 INFO L168 Benchmark]: Boogie Preprocessor took 56.24 ms. Allocated memory is still 307.8 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:34,772 INFO L168 Benchmark]: RCFGBuilder took 252.50 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 235.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:34,772 INFO L168 Benchmark]: TraceAbstraction took 22514.05 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 235.6 MB in the beginning and 468.0 MB in the end (delta: -232.4 MB). Peak memory consumption was 202.5 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:34,774 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.25 ms. Allocated memory is still 307.8 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.68 ms. Allocated memory is still 307.8 MB. Free memory was 266.6 MB in the beginning and 256.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 56.24 ms. Allocated memory is still 307.8 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 252.50 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 235.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22514.05 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 235.6 MB in the beginning and 468.0 MB in the end (delta: -232.4 MB). Peak memory consumption was 202.5 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[cstrcpy_#t~post0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-28 21:01:34,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-28 21:01:34,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,801 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-28 21:01:34,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-28 21:01:34,807 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,807 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,807 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:01:34,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:01:34,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((((((!(s1 == s2) && 0 == s2) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && 2 <= dst) && 1 == \valid[s1]) && 1 <= src) && !(s1 == s2)) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && dst + unknown-#length-unknown[src] <= src + unknown-#length-unknown[dst]) && 0 == s1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 == \valid[src]) && !(dst == s2)) && 1 <= unknown-#length-unknown[s2]) && !(dst == src)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && 1 == \valid[s2]) || !(\valid[s1] == 1)) || s1 == s2) || !(1 == \valid[s2])) || !(0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + -1])) || !(0 == s1)) || ((((((((((((((((((((!(s1 == s2) && 0 == s2) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && 0 == dst) && 0 == src) && 1 == \valid[s1]) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && !(s1 == s2)) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && unknown-#length-unknown[s2] <= unknown-#length-unknown[dst]) && 0 == s1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 == \valid[src]) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && !(dst == s2)) && 1 <= unknown-#length-unknown[src]) && 1 <= unknown-#length-unknown[s2]) && !(dst == src)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 1 == \valid[dst]) && 1 == \valid[s2])) || (((((((((((((((((((((!(s1 == s2) && 0 == s2) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && dst <= 1) && 1 == \valid[s1]) && (\exists cstrcpy_#t~post0.offset : int, cstrcpy_#t~post0.base : int :: unknown-#memory_int-unknown[cstrcpy_#t~post0.base][cstrcpy_#t~post0.offset] == unknown-#memory_int-unknown[src][src + -1] && !(src == cstrcpy_#t~post0.base))) && !(s1 == s2)) && !(0 == unknown-#memory_int-unknown[src][src + -1])) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && 0 == s1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 <= dst) && 1 == \valid[src]) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && !(dst == s2)) && ((src + 2 <= unknown-#length-unknown[src] && 1 <= src) || (src <= 1 && 1 <= src))) && 1 <= unknown-#length-unknown[s2]) && !(dst == src)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && 1 == \valid[s2])) || !(0 == s2)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || unknown-#length-unknown[s2] < 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 7 error locations. SAFE Result, 22.4s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 572 SDtfs, 1486 SDslu, 5303 SDs, 0 SdLazy, 4206 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 541 GetRequests, 185 SyntacticMatches, 11 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 599 HoareAnnotationTreeSize, 7 FomulaSimplifications, 25 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 879 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 723 ConstructedInterpolants, 36 QuantifiedInterpolants, 374185 SizeOfPredicates, 127 NumberOfNonLiveVariables, 855 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 25/224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-01-34-823.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-01-34-823.csv Received shutdown request...