java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:49:22,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:49:22,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:49:22,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:49:22,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:49:22,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:49:22,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:49:22,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:49:22,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:49:22,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:49:22,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:49:22,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:49:22,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:49:22,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:49:22,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:49:22,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:49:22,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:49:22,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:49:22,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:49:22,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:49:22,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:49:22,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:49:22,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:49:22,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:49:22,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:49:22,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:49:22,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:49:22,402 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:49:22,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:49:22,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:49:22,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:49:22,403 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:49:22,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:49:22,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:49:22,412 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:49:22,412 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:49:22,412 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:49:22,413 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:49:22,413 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:49:22,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:49:22,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:49:22,413 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:49:22,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:49:22,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:49:22,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:49:22,414 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:49:22,414 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:49:22,414 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:49:22,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:49:22,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:49:22,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:49:22,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:49:22,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:49:22,415 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:49:22,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:49:22,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:49:22,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:49:22,416 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:49:22,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:49:22,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:49:22,416 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:49:22,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:49:22,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:49:22,417 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:49:22,417 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:49:22,417 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:49:22,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:49:22,462 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:49:22,466 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:49:22,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:49:22,467 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:49:22,468 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-24 11:49:22,623 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:49:22,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:49:22,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:49:22,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:49:22,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:49:22,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5054e5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22, skipping insertion in model container [2018-01-24 11:49:22,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:49:22,690 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:49:22,809 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:49:22,827 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:49:22,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22 WrapperNode [2018-01-24 11:49:22,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:49:22,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:49:22,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:49:22,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:49:22,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... [2018-01-24 11:49:22,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:49:22,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:49:22,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:49:22,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:49:22,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:49:22,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:49:22,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:49:22,917 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-01-24 11:49:22,918 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:49:22,918 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:49:22,918 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:49:22,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:49:22,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:49:22,918 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:49:22,918 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:49:22,919 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-01-24 11:49:22,919 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:49:22,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:49:22,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:49:23,100 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:49:23,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:49:23 BoogieIcfgContainer [2018-01-24 11:49:23,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:49:23,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:49:23,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:49:23,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:49:23,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:49:22" (1/3) ... [2018-01-24 11:49:23,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3bdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:49:23, skipping insertion in model container [2018-01-24 11:49:23,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:22" (2/3) ... [2018-01-24 11:49:23,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3bdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:49:23, skipping insertion in model container [2018-01-24 11:49:23,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:49:23" (3/3) ... [2018-01-24 11:49:23,107 INFO L105 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:49:23,113 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:49:23,119 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 11:49:23,157 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:49:23,157 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:49:23,157 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:49:23,157 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:49:23,158 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:49:23,158 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:49:23,158 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:49:23,158 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:49:23,159 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:49:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 11:49:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:49:23,186 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:23,187 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:23,187 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:23,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-01-24 11:49:23,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:23,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:23,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:23,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:23,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:23,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:23,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:23,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:49:23,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:49:23,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:49:23,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:49:23,385 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 11:49:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:23,567 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-24 11:49:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:49:23,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 11:49:23,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:23,576 INFO L225 Difference]: With dead ends: 51 [2018-01-24 11:49:23,576 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:49:23,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:49:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:49:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 11:49:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:49:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:49:23,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-01-24 11:49:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:23,607 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:49:23,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:49:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:49:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:49:23,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:23,608 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:23,608 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-01-24 11:49:23,608 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:23,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:23,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:23,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:23,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:23,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:23,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:23,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:49:23,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:49:23,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:49:23,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:49:23,766 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 11:49:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:23,829 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 11:49:23,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:49:23,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 11:49:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:23,831 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:49:23,831 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 11:49:23,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:49:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 11:49:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 11:49:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:49:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 11:49:23,837 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-01-24 11:49:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:23,838 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 11:49:23,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:49:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 11:49:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:49:23,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:23,839 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:23,839 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:23,840 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-01-24 11:49:23,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:23,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:23,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:23,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:23,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:23,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:23,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:23,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:49:23,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:49:23,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:49:23,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:49:23,917 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 11:49:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:24,015 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 11:49:24,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:49:24,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 11:49:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:24,017 INFO L225 Difference]: With dead ends: 35 [2018-01-24 11:49:24,017 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 11:49:24,017 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:49:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 11:49:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 11:49:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 11:49:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-24 11:49:24,023 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-24 11:49:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:24,023 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-24 11:49:24,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:49:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-24 11:49:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:49:24,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:24,024 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:24,024 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-01-24 11:49:24,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:24,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:24,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:24,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:24,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:24,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:24,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:24,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:49:24,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:49:24,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:49:24,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:49:24,185 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-01-24 11:49:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:24,356 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 11:49:24,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:49:24,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 11:49:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:24,360 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:49:24,360 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 11:49:24,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:49:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 11:49:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-01-24 11:49:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 11:49:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-01-24 11:49:24,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-01-24 11:49:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:24,368 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-01-24 11:49:24,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:49:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-01-24 11:49:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:49:24,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:24,370 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:24,370 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-01-24 11:49:24,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:24,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:24,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:24,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:24,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:24,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:24,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:24,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 11:49:24,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:49:24,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:49:24,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:49:24,553 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-01-24 11:49:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:24,677 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-01-24 11:49:24,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:49:24,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 11:49:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:24,678 INFO L225 Difference]: With dead ends: 77 [2018-01-24 11:49:24,678 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 11:49:24,679 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:49:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 11:49:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-01-24 11:49:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:49:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 11:49:24,685 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-01-24 11:49:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:24,685 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 11:49:24,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:49:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 11:49:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:49:24,686 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:24,686 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:24,686 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-01-24 11:49:24,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:24,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:24,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:24,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:24,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:24,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:24,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:24,932 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:24,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:24,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:25,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:49:25,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:49:25,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:25,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:25,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:49:25,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:49:25,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 11:49:25,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:49:25,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:49:25,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:25,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:25,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 11:49:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:25,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:25,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-01-24 11:49:25,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:49:25,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:49:25,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:49:25,403 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-01-24 11:49:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:28,391 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-01-24 11:49:28,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:49:28,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-01-24 11:49:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:28,392 INFO L225 Difference]: With dead ends: 111 [2018-01-24 11:49:28,392 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 11:49:28,393 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:49:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 11:49:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 58. [2018-01-24 11:49:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 11:49:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-01-24 11:49:28,404 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-01-24 11:49:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:28,405 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-01-24 11:49:28,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:49:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-01-24 11:49:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:49:28,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:28,407 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:28,407 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-01-24 11:49:28,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:28,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:28,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:28,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:28,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:28,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:28,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:28,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:49:28,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:49:28,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:49:28,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:49:28,504 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2018-01-24 11:49:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:28,588 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-24 11:49:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:49:28,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 11:49:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:28,589 INFO L225 Difference]: With dead ends: 58 [2018-01-24 11:49:28,589 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 11:49:28,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:49:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 11:49:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 11:49:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 11:49:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 11:49:28,594 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2018-01-24 11:49:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:28,594 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 11:49:28,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:49:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 11:49:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:49:28,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:28,596 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:28,596 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1201761770, now seen corresponding path program 2 times [2018-01-24 11:49:28,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:28,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:28,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:28,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:28,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:28,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:28,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:28,911 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:28,918 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:49:28,931 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:49:28,936 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:49:28,938 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:49:28,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:28,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:49:28,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:28,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:28,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:49:28,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:49:28,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:49:28,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:28,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:28,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:28,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 11:49:29,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 11:49:29,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:49:29,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:49:29,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:29,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:29,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 11:49:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:29,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:29,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-24 11:49:29,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:49:29,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:49:29,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:49:29,170 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 18 states. [2018-01-24 11:49:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:30,016 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-01-24 11:49:30,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:49:30,017 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-24 11:49:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:30,017 INFO L225 Difference]: With dead ends: 78 [2018-01-24 11:49:30,017 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 11:49:30,018 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 11:49:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 11:49:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-01-24 11:49:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:49:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 11:49:30,025 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2018-01-24 11:49:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:30,025 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 11:49:30,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:49:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 11:49:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 11:49:30,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:30,026 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:30,026 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:49:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2006324798, now seen corresponding path program 1 times [2018-01-24 11:49:30,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:30,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:30,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:30,027 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:49:30,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:30,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:30,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:30,230 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:30,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:30,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:30,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:49:30,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:30,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:30,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:49:30,330 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-24 11:49:30,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 11:49:30,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:30,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:30,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:30,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 11:49:30,382 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-24 11:49:30,391 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-24 11:49:30,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:49:30,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:30,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:30,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-24 11:49:30,509 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 29 treesize of output 25 [2018-01-24 11:49:30,520 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-24 11:49:30,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:49:30,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:30,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:30,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:34 [2018-01-24 11:49:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:30,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:30,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-01-24 11:49:30,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 11:49:30,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 11:49:30,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:49:30,688 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 21 states. [2018-01-24 11:49:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:31,159 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 11:49:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:49:31,159 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-01-24 11:49:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:31,159 INFO L225 Difference]: With dead ends: 48 [2018-01-24 11:49:31,160 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:49:31,160 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:49:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:49:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:49:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:49:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:49:31,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-24 11:49:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:31,161 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:49:31,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 11:49:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:49:31,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:49:31,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:49:31,722 WARN L146 SmtUtils]: Spent 471ms on a formula simplification. DAG size of input: 127 DAG size of output 72 [2018-01-24 11:49:31,844 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,844 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:31,844 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,844 INFO L397 ceAbstractionStarter]: At program point cstrreplaceENTRY(lines 540 552) the Hoare annotation is: (let ((.cse4 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse0 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse1 (< .cse4 1)) (.cse3 (select |old(#memory_int)| |cstrreplace_#in~s.base|)) (.cse2 (not (= 0 |cstrreplace_#in~s.offset|)))) (and (or (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString1~5.offset_BEFORE_CALL_2 |cstrreplace_#in~s.offset|) (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_2 0) (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) (+ (select |#length| |cstrreplace_#in~s.base|) v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1)))))) .cse0 .cse1 .cse2 (not (= 0 (select .cse3 (+ .cse4 (- 1)))))) (or .cse0 .cse1 (not (= (select .cse3 |cstrreplace_#in~s.offset|) 0)) .cse2 (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)))))) [2018-01-24 11:49:31,845 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 550) the Hoare annotation is: (let ((.cse12 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse0 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse1 (< .cse12 1)) (.cse3 (not (= 0 |cstrreplace_#in~s.offset|))) (.cse6 (select |#memory_int| |cstrreplace_#in~s.base|)) (.cse2 (select |old(#memory_int)| |cstrreplace_#in~s.base|)) (.cse7 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_1 Int)) (and (<= cstrreplace_~p~2.offset v_main_~nondetString1~5.offset_BEFORE_CALL_1) (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_1) (select |#length| cstrreplace_~p~2.base)) (<= 1 main_~length1~5) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_1 (- 1))))))) (.cse8 (= cstrreplace_~p~2.offset 0)) (.cse5 (= 1 (select |#valid| cstrreplace_~p~2.base))) (.cse4 (select |#memory_int| cstrreplace_~p~2.base))) (and (or .cse0 .cse1 (not (= (select .cse2 |cstrreplace_#in~s.offset|) 0)) .cse3 (and (= 0 (select .cse4 cstrreplace_~p~2.offset)) .cse5 (= 0 (select .cse6 |cstrreplace_#in~s.offset|)) .cse7 .cse8)) (let ((.cse10 (select |#length| cstrreplace_~p~2.base))) (let ((.cse11 (+ .cse12 (- 1))) (.cse9 (= 0 (select .cse4 (+ .cse10 (- 1)))))) (or .cse0 .cse1 .cse3 (and .cse9 (and (<= 1 cstrreplace_~p~2.offset) (<= (+ cstrreplace_~p~2.offset 1) .cse10) .cse5) (= 0 (select .cse6 .cse11))) (not (= 0 (select .cse2 .cse11))) (and .cse9 .cse7 .cse8 .cse5 (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString1~5.offset_BEFORE_CALL_2 |cstrreplace_#in~s.offset|) (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_2 0) (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) (+ (select |#length| |cstrreplace_#in~s.base|) v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1))))))))))))) [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point L544''''(lines 544 550) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point cstrreplaceFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 11:49:31,845 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point L545'''(lines 545 548) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point cstrreplaceEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L397 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 (select (select |#memory_int| main_~nondetString1~5.base) (+ .cse0 (+ main_~nondetString1~5.offset (- 1))))) (= 0 main_~nondetString1~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|))) [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,846 INFO L401 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-24 11:49:31,847 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 11:49:31,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,859 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,859 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,859 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,859 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,860 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,862 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,862 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,876 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,876 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,876 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,876 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,877 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,878 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,879 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,880 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:49:31 BoogieIcfgContainer [2018-01-24 11:49:31,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:49:31,884 INFO L168 Benchmark]: Toolchain (without parser) took 9260.26 ms. Allocated memory was 307.2 MB in the beginning and 543.2 MB in the end (delta: 235.9 MB). Free memory was 267.3 MB in the beginning and 498.8 MB in the end (delta: -231.5 MB). Peak memory consumption was 176.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:31,885 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:49:31,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.64 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:31,886 INFO L168 Benchmark]: Boogie Preprocessor took 33.24 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 255.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 11:49:31,886 INFO L168 Benchmark]: RCFGBuilder took 230.56 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 238.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:31,887 INFO L168 Benchmark]: TraceAbstraction took 8781.14 ms. Allocated memory was 307.2 MB in the beginning and 543.2 MB in the end (delta: 235.9 MB). Free memory was 238.6 MB in the beginning and 498.8 MB in the end (delta: -260.2 MB). Peak memory consumption was 147.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:31,888 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.14 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.64 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.24 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 255.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 230.56 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 238.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8781.14 ms. Allocated memory was 307.2 MB in the beginning and 543.2 MB in the end (delta: 235.9 MB). Free memory was 238.6 MB in the beginning and 498.8 MB in the end (delta: -260.2 MB). Peak memory consumption was 147.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[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[v_main_~nondetString1~5.offset_BEFORE_CALL_1,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[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,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[v_main_~nondetString1~5.offset_BEFORE_CALL_1,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[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 * 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-24 11:49:31,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 11:49:31,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:49:31,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:31,908 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,908 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,910 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:31,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:49:31,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(1 == \valid[s]) || unknown-#length-unknown[s] < 1) || !(\old(unknown-#memory_int-unknown)[s][s] == 0)) || !(0 == s)) || ((((0 == unknown-#memory_int-unknown[p][p] && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[s][s]) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_1 : int :: ((p <= v_main_~nondetString1~5.offset_BEFORE_CALL_1 && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 <= unknown-#length-unknown[p]) && 1 <= main_~length1~5) && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 + -1])) && p == 0)) && (((((!(1 == \valid[s]) || unknown-#length-unknown[s] < 1) || !(0 == s)) || ((0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] && (1 <= p && p + 1 <= unknown-#length-unknown[p]) && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1])) || !(0 == \old(unknown-#memory_int-unknown)[s][unknown-#length-unknown[s] + -1])) || ((((0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_1 : int :: ((p <= v_main_~nondetString1~5.offset_BEFORE_CALL_1 && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 <= unknown-#length-unknown[p]) && 1 <= main_~length1~5) && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 + -1])) && p == 0) && 1 == \valid[p]) && (\exists v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= s && 0 <= v_main_~nondetString1~5.offset_BEFORE_CALL_2) && v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= 0) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. SAFE Result, 8.6s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 470 SDslu, 909 SDs, 0 SdLazy, 871 SolverSat, 155 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 16 NumberOfFragments, 357 HoareAnnotationTreeSize, 9 FomulaSimplifications, 377 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 988 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 248 ConstructedInterpolants, 14 QuantifiedInterpolants, 67446 SizeOfPredicates, 25 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-49-31-916.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-49-31-916.csv Received shutdown request...