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/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:33:16,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:33:16,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:33:16,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:33:16,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:33:16,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:33:16,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:33:16,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:33:16,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:33:16,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:33:16,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:33:16,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:33:16,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:33:16,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:33:16,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:33:16,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:33:16,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:33:16,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:33:16,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:33:16,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:33:16,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:33:16,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:33:16,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:33:16,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:33:16,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:33:16,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:33:16,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:33:16,329 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:33:16,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:33:16,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:33:16,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:33:16,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:33:16,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:33:16,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:33:16,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:33:16,346 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:33:16,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:33:16,347 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:33:16,347 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:33:16,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:33:16,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:33:16,348 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:33:16,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:33:16,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:33:16,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:33:16,348 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:33:16,349 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:33:16,349 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:33:16,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:33:16,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:33:16,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:33:16,350 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:33:16,350 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:33:16,350 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:33:16,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:33:16,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:33:16,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:33:16,351 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:33:16,351 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:33:16,351 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:33:16,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:33:16,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:33:16,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:33:16,352 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:33:16,353 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:33:16,353 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:33:16,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:33:16,408 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:33:16,411 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:33:16,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:33:16,413 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:33:16,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:33:16,608 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:33:16,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:33:16,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:33:16,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:33:16,628 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:33:16,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167868dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16, skipping insertion in model container [2018-01-31 08:33:16,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:33:16,709 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:33:16,883 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:33:16,912 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:33:16,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16 WrapperNode [2018-01-31 08:33:16,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:33:16,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:33:16,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:33:16,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:33:16,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... [2018-01-31 08:33:16,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:33:16,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:33:16,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:33:16,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:33:16,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:33:17,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:33:17,029 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:33:17,029 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-01-31 08:33:17,029 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:33:17,029 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:33:17,029 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:33:17,030 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:33:17,030 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:33:17,033 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:33:17,034 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:33:17,034 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-01-31 08:33:17,034 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:33:17,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:33:17,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:33:17,504 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:33:17,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:33:17 BoogieIcfgContainer [2018-01-31 08:33:17,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:33:17,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:33:17,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:33:17,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:33:17,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:33:16" (1/3) ... [2018-01-31 08:33:17,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d68c946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:33:17, skipping insertion in model container [2018-01-31 08:33:17,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:33:16" (2/3) ... [2018-01-31 08:33:17,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d68c946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:33:17, skipping insertion in model container [2018-01-31 08:33:17,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:33:17" (3/3) ... [2018-01-31 08:33:17,521 INFO L107 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:33:17,531 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:33:17,540 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 08:33:17,594 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:33:17,595 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:33:17,595 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:33:17,595 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:33:17,595 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:33:17,595 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:33:17,595 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:33:17,596 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:33:17,596 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:33:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 08:33:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:33:17,626 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:17,627 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:17,628 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash 677251971, now seen corresponding path program 1 times [2018-01-31 08:33:17,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:17,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:17,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:17,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:17,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:17,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:17,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:33:17,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:33:17,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:33:17,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:33:17,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:33:17,981 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-01-31 08:33:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:18,280 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-01-31 08:33:18,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:33:18,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-31 08:33:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:18,380 INFO L225 Difference]: With dead ends: 76 [2018-01-31 08:33:18,381 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 08:33:18,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:33:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 08:33:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-31 08:33:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 08:33:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-31 08:33:18,417 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 13 [2018-01-31 08:33:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:18,418 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-31 08:33:18,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:33:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-31 08:33:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:33:18,419 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:18,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:18,420 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash 677251972, now seen corresponding path program 1 times [2018-01-31 08:33:18,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:18,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:18,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:18,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:18,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:18,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:18,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:33:18,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:33:18,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:33:18,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:33:18,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:33:18,764 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2018-01-31 08:33:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:18,879 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-31 08:33:18,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:33:18,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-31 08:33:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:18,881 INFO L225 Difference]: With dead ends: 57 [2018-01-31 08:33:18,881 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 08:33:18,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:33:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 08:33:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-31 08:33:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 08:33:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-31 08:33:18,889 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 13 [2018-01-31 08:33:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:18,890 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-31 08:33:18,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:33:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-31 08:33:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:33:18,891 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:18,891 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:18,891 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash -277412007, now seen corresponding path program 1 times [2018-01-31 08:33:18,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:18,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:18,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:18,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:18,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:18,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:19,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:33:19,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:33:19,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:33:19,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:33:19,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:33:19,099 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2018-01-31 08:33:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:19,358 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-31 08:33:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:33:19,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:33:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:19,360 INFO L225 Difference]: With dead ends: 60 [2018-01-31 08:33:19,360 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 08:33:19,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:33:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 08:33:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-31 08:33:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 08:33:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-31 08:33:19,368 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 23 [2018-01-31 08:33:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:19,368 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-31 08:33:19,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:33:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-31 08:33:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:33:19,369 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:19,370 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:19,370 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:19,370 INFO L82 PathProgramCache]: Analyzing trace with hash -277412006, now seen corresponding path program 1 times [2018-01-31 08:33:19,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:19,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:19,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:19,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:19,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:19,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:19,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:33:19,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:33:19,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:33:19,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:33:19,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:33:19,555 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 9 states. [2018-01-31 08:33:19,930 WARN L143 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:33:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:20,052 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-31 08:33:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:33:20,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-31 08:33:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:20,057 INFO L225 Difference]: With dead ends: 75 [2018-01-31 08:33:20,057 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 08:33:20,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:33:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 08:33:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-01-31 08:33:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 08:33:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-31 08:33:20,066 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 23 [2018-01-31 08:33:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:20,066 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-31 08:33:20,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:33:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-31 08:33:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 08:33:20,067 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:20,067 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:20,067 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1145030291, now seen corresponding path program 1 times [2018-01-31 08:33:20,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:20,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:20,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:20,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:20,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:20,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:33:20,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:33:20,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:33:20,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:33:20,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:33:20,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:33:20,191 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 7 states. [2018-01-31 08:33:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:20,373 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-31 08:33:20,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:33:20,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-31 08:33:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:20,374 INFO L225 Difference]: With dead ends: 62 [2018-01-31 08:33:20,375 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 08:33:20,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:33:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 08:33:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-31 08:33:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 08:33:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-31 08:33:20,384 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 33 [2018-01-31 08:33:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:20,385 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-31 08:33:20,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:33:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-31 08:33:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 08:33:20,386 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:20,386 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:20,386 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1145030290, now seen corresponding path program 1 times [2018-01-31 08:33:20,387 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:20,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:20,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:20,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:20,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:20,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:20,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:33:20,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:33:20,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:21,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:33:21,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:33:21,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 08:33:21,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:21,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:33:21,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:33:21,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:33:21,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-31 08:33:21,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:33:21,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:33:21,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:33:21,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:33:21,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 08:33:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:21,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:33:21,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-31 08:33:21,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:33:21,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:33:21,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:33:21,622 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 20 states. [2018-01-31 08:33:24,866 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 59 DAG size of output 51 [2018-01-31 08:33:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:28,484 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2018-01-31 08:33:28,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:33:28,484 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-01-31 08:33:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:28,486 INFO L225 Difference]: With dead ends: 158 [2018-01-31 08:33:28,486 INFO L226 Difference]: Without dead ends: 155 [2018-01-31 08:33:28,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=241, Invalid=1241, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:33:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-31 08:33:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 76. [2018-01-31 08:33:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 08:33:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-31 08:33:28,497 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 33 [2018-01-31 08:33:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:28,497 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-31 08:33:28,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:33:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-31 08:33:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:33:28,499 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:28,499 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:28,499 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -692482562, now seen corresponding path program 1 times [2018-01-31 08:33:28,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:28,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:28,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:28,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:28,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:28,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:28,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:33:28,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:33:28,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:33:28,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:33:28,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:33:28,738 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 4 states. [2018-01-31 08:33:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:28,933 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-31 08:33:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:33:28,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-31 08:33:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:28,934 INFO L225 Difference]: With dead ends: 76 [2018-01-31 08:33:28,934 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 08:33:28,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:33:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 08:33:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-31 08:33:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 08:33:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-01-31 08:33:28,943 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 36 [2018-01-31 08:33:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:28,944 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-01-31 08:33:28,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:33:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-01-31 08:33:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:33:28,945 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:28,945 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:28,946 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:33:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash -846142846, now seen corresponding path program 2 times [2018-01-31 08:33:28,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:28,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:28,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:28,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:28,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:28,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:29,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:33:29,505 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-31 08:33:29,519 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:33:29,544 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:33:29,560 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:33:29,571 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:33:29,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:33:29,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:33:29,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 08:33:29,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:29,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:33:29,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:33:29,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:33:32,399 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 28 treesize of output 22 [2018-01-31 08:33:32,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:33:32,507 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-31 08:33:32,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:33:32,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:33:32,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:33:32,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:43 [2018-01-31 08:33:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:33:32,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:33:32,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 25 [2018-01-31 08:33:32,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:33:32,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:33:32,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=592, Unknown=1, NotChecked=0, Total=650 [2018-01-31 08:33:32,654 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 26 states. [2018-01-31 08:33:33,577 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 63 DAG size of output 60 [2018-01-31 08:33:33,716 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 66 DAG size of output 63 [2018-01-31 08:33:34,010 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 66 DAG size of output 58 [2018-01-31 08:33:40,488 WARN L146 SmtUtils]: Spent 6250ms on a formula simplification. DAG size of input: 102 DAG size of output 81 [2018-01-31 08:33:46,696 WARN L146 SmtUtils]: Spent 4145ms on a formula simplification. DAG size of input: 81 DAG size of output 66 [2018-01-31 08:33:48,864 WARN L146 SmtUtils]: Spent 2129ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-01-31 08:33:49,078 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 73 DAG size of output 70 [2018-01-31 08:33:57,231 WARN L146 SmtUtils]: Spent 8117ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-01-31 08:33:57,413 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-01-31 08:34:03,653 WARN L146 SmtUtils]: Spent 6171ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-01-31 08:34:03,840 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 61 DAG size of output 59 [2018-01-31 08:34:04,103 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 66 DAG size of output 63 [2018-01-31 08:34:04,300 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-01-31 08:34:12,479 WARN L146 SmtUtils]: Spent 8126ms on a formula simplification. DAG size of input: 94 DAG size of output 85 [2018-01-31 08:34:27,373 WARN L146 SmtUtils]: Spent 2684ms on a formula simplification. DAG size of input: 85 DAG size of output 77 [2018-01-31 08:34:33,576 WARN L146 SmtUtils]: Spent 2151ms on a formula simplification. DAG size of input: 73 DAG size of output 64 [2018-01-31 08:34:37,750 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 67 DAG size of output 62 [2018-01-31 08:34:47,783 WARN L146 SmtUtils]: Spent 1975ms on a formula simplification. DAG size of input: 74 DAG size of output 67 [2018-01-31 08:34:50,022 WARN L146 SmtUtils]: Spent 2164ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-01-31 08:34:50,241 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-01-31 08:34:53,534 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 69 DAG size of output 64 [2018-01-31 08:34:57,919 WARN L146 SmtUtils]: Spent 2163ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-01-31 08:35:04,524 WARN L146 SmtUtils]: Spent 2161ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-01-31 08:35:10,852 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-31 08:35:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:35:15,245 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2018-01-31 08:35:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 08:35:15,245 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-01-31 08:35:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:35:15,248 INFO L225 Difference]: With dead ends: 167 [2018-01-31 08:35:15,248 INFO L226 Difference]: Without dead ends: 164 [2018-01-31 08:35:15,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 78.2s TimeCoverageRelationStatistics Valid=667, Invalid=3612, Unknown=11, NotChecked=0, Total=4290 [2018-01-31 08:35:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-31 08:35:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 88. [2018-01-31 08:35:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:35:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-31 08:35:15,270 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 43 [2018-01-31 08:35:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:35:15,270 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-31 08:35:15,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:35:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-31 08:35:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 08:35:15,273 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:35:15,273 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-31 08:35:15,273 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:35:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash 35164530, now seen corresponding path program 1 times [2018-01-31 08:35:15,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:35:15,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:35:15,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:35:15,274 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:35:15,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:35:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:35:15,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:35:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:35:15,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:35:15,771 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:35:15,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:35:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:35:15,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:35:15,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:35:15,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:35:15,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:35:15,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:35:15,857 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 15 treesize of output 12 [2018-01-31 08:35:15,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:35:15,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:35:15,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:35:15,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:35:15,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-31 08:35:15,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-31 08:35:15,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:35:15,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:35:15,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:35:15,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:35:15,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-31 08:35:16,103 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-31 08:35:16,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:35:16,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:35:16,116 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 15 treesize of output 12 [2018-01-31 08:35:16,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:35:16,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:35:16,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:35:16,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:34 [2018-01-31 08:35:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:35:16,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:35:16,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2018-01-31 08:35:16,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:35:16,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:35:16,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:35:16,262 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 28 states. [2018-01-31 08:35:17,522 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 65 DAG size of output 44 [2018-01-31 08:35:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:35:17,561 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-01-31 08:35:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:35:17,561 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2018-01-31 08:35:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:35:17,563 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:35:17,563 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:35:17,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=506, Invalid=1944, Unknown=0, NotChecked=0, Total=2450 [2018-01-31 08:35:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:35:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:35:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:35:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:35:17,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-01-31 08:35:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:35:17,565 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:35:17,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:35:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:35:17,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:35:17,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:35:17,674 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:35:17,676 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:35:17,714 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 167 DAG size of output 160 [2018-01-31 08:35:42,891 WARN L146 SmtUtils]: Spent 25164ms on a formula simplification. DAG size of input: 180 DAG size of output 78 [2018-01-31 08:35:44,970 WARN L146 SmtUtils]: Spent 2075ms on a formula simplification. DAG size of input: 68 DAG size of output 34 [2018-01-31 08:35:45,019 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,020 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,020 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:35:45,020 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,020 INFO L395 ceAbstractionStarter]: At program point cstrreplaceENTRY(lines 540 552) the Hoare annotation is: (let ((.cse0 (+ (select |#length| |cstrreplace_#in~s.base|) (- 1)))) (or (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) .cse0)) (not (= 1 (select |#valid| |cstrreplace_#in~s.base|))) (not (= 0 |cstrreplace_#in~s.offset|)) (not (exists ((main_~length1~5 Int)) (and (<= 1 main_~length1~5) (<= (+ main_~length1~5 |cstrreplace_#in~s.offset|) (select |#length| |cstrreplace_#in~s.base|)) (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) (+ main_~length1~5 |cstrreplace_#in~s.offset| (- 1))))))) (not (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) .cse0))))) [2018-01-31 08:35:45,020 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,020 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 08:35:45,020 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:35:45,020 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-31 08:35:45,020 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point cstrreplaceFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L545'''''(lines 545 548) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:35:45,021 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point L544''''''(lines 544 550) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point cstrreplaceEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L395 ceAbstractionStarter]: At program point L544'''''(lines 544 550) the Hoare annotation is: (let ((.cse8 (+ (select |#length| |cstrreplace_#in~s.base|) (- 1))) (.cse1 (select |#length| cstrreplace_~p~2.base)) (.cse7 (select |#length| cstrreplace_~s.base))) (let ((.cse0 (= 0 (select (select |#memory_int| cstrreplace_~s.base) (+ .cse7 (- 1))))) (.cse2 (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ .cse1 (- 1))))) (.cse3 (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) .cse8))) (.cse5 (= 1 (select |#valid| cstrreplace_~s.base))) (.cse4 (= 0 cstrreplace_~s.offset)) (.cse6 (= 1 (select |#valid| cstrreplace_~p~2.base)))) (or (not (= 0 |cstrreplace_#in~s.offset|)) (and .cse0 (<= (+ cstrreplace_~p~2.offset 1) .cse1) .cse2 .cse3 (and .cse4 (and .cse5 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_1) (select |#length| cstrreplace_~s.base)) (<= 1 main_~length1~5) (<= cstrreplace_~s.offset v_main_~nondetString1~5.offset_BEFORE_CALL_1) (= 0 (select (select |#memory_int| cstrreplace_~s.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_1 (- 1)))))) (<= 1 cstrreplace_~p~2.offset) .cse6))) (and .cse0 .cse2 .cse3 .cse5 (<= 1 .cse7) .cse4 (= 0 cstrreplace_~p~2.offset) .cse6 (exists ((main_~length1~5 Int)) (and (<= 1 main_~length1~5) (<= (+ main_~length1~5 cstrreplace_~p~2.offset) (select |#length| cstrreplace_~p~2.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ main_~length1~5 cstrreplace_~p~2.offset (- 1))))))) (not (= 1 (select |#valid| |cstrreplace_#in~s.base|))) (not (exists ((main_~length1~5 Int)) (and (<= 1 main_~length1~5) (<= (+ main_~length1~5 |cstrreplace_#in~s.offset|) (select |#length| |cstrreplace_#in~s.base|)) (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) (+ main_~length1~5 |cstrreplace_#in~s.offset| (- 1))))))) (not (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) .cse8)))))) [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-31 08:35:45,022 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point L560''''(line 560) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point L560'''''(line 560) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-31 08:35:45,023 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L560'''(line 560) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L395 ceAbstractionStarter]: At program point L560'(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~5.base))) (and (= 1 (select |#valid| main_~nondetString1~5.base)) (= 0 |main_#t~malloc6.offset|) (= main_~length1~5 .cse0) (<= 1 main_~length1~5) (= main_~length1~5 (select |#length| |main_#t~malloc6.base|)) (= 0 main_~nondetString1~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= 0 (select (select |#memory_int| main_~nondetString1~5.base) (+ main_~nondetString1~5.offset (+ .cse0 (- 1))))) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|))) [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L560''''''(line 560) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-31 08:35:45,024 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:35:45,025 INFO L399 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-31 08:35:45,025 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-31 08:35:45,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:35:45 BoogieIcfgContainer [2018-01-31 08:35:45,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:35:45,076 INFO L168 Benchmark]: Toolchain (without parser) took 148466.29 ms. Allocated memory was 306.2 MB in the beginning and 526.4 MB in the end (delta: 220.2 MB). Free memory was 265.9 MB in the beginning and 420.7 MB in the end (delta: -154.8 MB). Peak memory consumption was 173.5 MB. Max. memory is 5.3 GB. [2018-01-31 08:35:45,077 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 306.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:35:45,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.44 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:35:45,078 INFO L168 Benchmark]: Boogie Preprocessor took 50.65 ms. Allocated memory is still 306.2 MB. Free memory was 254.7 MB in the beginning and 253.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-31 08:35:45,078 INFO L168 Benchmark]: RCFGBuilder took 532.54 ms. Allocated memory is still 306.2 MB. Free memory was 252.7 MB in the beginning and 234.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:35:45,078 INFO L168 Benchmark]: TraceAbstraction took 147568.19 ms. Allocated memory was 306.2 MB in the beginning and 526.4 MB in the end (delta: 220.2 MB). Free memory was 234.7 MB in the beginning and 420.7 MB in the end (delta: -186.0 MB). Peak memory consumption was 142.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:35:45,080 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.16 ms. Allocated memory is still 306.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 301.44 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.65 ms. Allocated memory is still 306.2 MB. Free memory was 254.7 MB in the beginning and 253.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 532.54 ms. Allocated memory is still 306.2 MB. Free memory was 252.7 MB in the beginning and 234.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 147568.19 ms. Allocated memory was 306.2 MB in the beginning and 526.4 MB in the end (delta: 220.2 MB). Free memory was 234.7 MB in the beginning and 420.7 MB in the end (delta: -186.0 MB). Peak memory consumption was 142.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 553]: 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 9 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-31 08:35:45,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:35:45,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-31 08:35:45,101 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,101 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,101 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,101 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:35:45,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:35:45,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == s) || ((((0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] && p + 1 <= unknown-#length-unknown[p]) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 0 == s && ((1 == \valid[s] && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_1 : int :: ((main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s] && 1 <= main_~length1~5) && s <= v_main_~nondetString1~5.offset_BEFORE_CALL_1) && 0 == unknown-#memory_int-unknown[s][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 + -1])) && 1 <= p) && 1 == \valid[p])) || ((((((((0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 1 == \valid[s]) && 1 <= unknown-#length-unknown[s]) && 0 == s) && 0 == p) && 1 == \valid[p]) && (\exists main_~length1~5 : int :: (1 <= main_~length1~5 && main_~length1~5 + p <= unknown-#length-unknown[p]) && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + p + -1]))) || !(1 == \valid[s])) || !(\exists main_~length1~5 : int :: (1 <= main_~length1~5 && main_~length1~5 + s <= unknown-#length-unknown[s]) && 0 == \old(unknown-#memory_int-unknown)[s][main_~length1~5 + s + -1])) || !(0 == \old(unknown-#memory_int-unknown)[s][unknown-#length-unknown[s] + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 9 error locations. SAFE Result, 147.4s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 112.4s AutomataDifference, 0.0s DeadEndRemovalTime, 27.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 445 SDtfs, 1559 SDslu, 2565 SDs, 0 SdLazy, 1424 SolverSat, 172 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 33.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 83.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=8, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 166 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 321 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1596 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2137 FormulaSimplificationTreeSizeReductionInter, 27.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 395 ConstructedInterpolants, 30 QuantifiedInterpolants, 171992 SizeOfPredicates, 52 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 10/102 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-35-45-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-35-45-111.csv Received shutdown request...