java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:44:23,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:44:23,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:44:23,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:44:23,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:44:23,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:44:23,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:44:23,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:44:23,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:44:23,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:44:23,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:44:23,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:44:23,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:44:23,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:44:23,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:44:23,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:44:23,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:44:23,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:44:23,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:44:23,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:44:23,464 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:44:23,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:44:23,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:44:23,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:44:23,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:44:23,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:44:23,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:44:23,468 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:44:23,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:44:23,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:44:23,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:44:23,469 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:44:23,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:44:23,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:44:23,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:44:23,480 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:44:23,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:44:23,480 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:44:23,480 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:44:23,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:44:23,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:44:23,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:44:23,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:44:23,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:44:23,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:44:23,482 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:44:23,482 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:44:23,482 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:44:23,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:44:23,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:44:23,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:44:23,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:44:23,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:44:23,484 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:44:23,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:44:23,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:44:23,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:44:23,484 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:44:23,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:44:23,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:44:23,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:44:23,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:44:23,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:44:23,486 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:44:23,486 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:44:23,487 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:44:23,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:44:23,533 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:44:23,536 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:44:23,537 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:44:23,537 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:44:23,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:44:23,694 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:44:23,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:44:23,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:44:23,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:44:23,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:44:23,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23, skipping insertion in model container [2018-01-24 11:44:23,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,728 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:44:23,765 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:44:23,878 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:44:23,895 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:44:23,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23 WrapperNode [2018-01-24 11:44:23,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:44:23,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:44:23,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:44:23,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:44:23,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (1/1) ... [2018-01-24 11:44:23,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:44:23,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:44:23,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:44:23,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:44:23,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (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:44:23,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:44:23,976 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:44:23,976 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-01-24 11:44:23,976 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-01-24 11:44:23,976 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:44:23,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:44:23,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:44:24,150 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:44:24,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:44:24 BoogieIcfgContainer [2018-01-24 11:44:24,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:44:24,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:44:24,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:44:24,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:44:24,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:44:23" (1/3) ... [2018-01-24 11:44:24,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b12b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:44:24, skipping insertion in model container [2018-01-24 11:44:24,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:23" (2/3) ... [2018-01-24 11:44:24,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b12b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:44:24, skipping insertion in model container [2018-01-24 11:44:24,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:44:24" (3/3) ... [2018-01-24 11:44:24,156 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:44:24,162 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:44:24,166 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 11:44:24,211 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:44:24,212 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:44:24,212 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:44:24,212 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:44:24,212 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:44:24,212 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:44:24,212 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:44:24,212 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:44:24,213 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:44:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 11:44:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:44:24,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:24,239 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:24,239 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979584, now seen corresponding path program 1 times [2018-01-24 11:44:24,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:24,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:24,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:24,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:24,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:24,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:24,392 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:44:24,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:24,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:44:24,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:44:24,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:44:24,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:44:24,413 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-01-24 11:44:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:24,506 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-24 11:44:24,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:44:24,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 11:44:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:24,578 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:44:24,579 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 11:44:24,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:44:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 11:44:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 11:44:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 11:44:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 11:44:24,609 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 11:44:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:24,609 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 11:44:24,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:44:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 11:44:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:44:24,610 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:24,610 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:24,611 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226348, now seen corresponding path program 1 times [2018-01-24 11:44:24,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:24,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:24,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:24,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:24,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:24,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:24,685 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:44:24,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:24,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:44:24,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:44:24,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:44:24,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:44:24,687 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 11:44:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:24,781 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 11:44:24,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:44:24,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:44:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:24,783 INFO L225 Difference]: With dead ends: 37 [2018-01-24 11:44:24,783 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:44:24,784 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:44:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:44:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 11:44:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:44:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:44:24,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 11:44:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:24,790 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:44:24,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:44:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:44:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:44:24,790 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:24,791 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:24,791 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226347, now seen corresponding path program 1 times [2018-01-24 11:44:24,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:24,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:24,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:24,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:24,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:24,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:24,891 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:44:24,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:24,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:44:24,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:44:24,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:44:24,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:44:24,893 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 11:44:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:24,984 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 11:44:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:44:24,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:44:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:24,985 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:44:24,985 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 11:44:24,986 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:44:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 11:44:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 11:44:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:44:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 11:44:24,991 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 11:44:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:24,992 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 11:44:24,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:44:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 11:44:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 11:44:24,993 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:24,993 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:24,993 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633306, now seen corresponding path program 1 times [2018-01-24 11:44:24,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:24,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:24,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:24,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:24,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:25,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:25,071 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:44:25,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:25,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:44:25,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:44:25,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:44:25,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:44:25,072 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 11:44:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:25,184 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 11:44:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:44:25,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 11:44:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:25,185 INFO L225 Difference]: With dead ends: 35 [2018-01-24 11:44:25,185 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 11:44:25,186 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:44:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 11:44:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 11:44:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 11:44:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 11:44:25,191 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-24 11:44:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:25,192 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 11:44:25,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:44:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 11:44:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 11:44:25,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:25,193 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:25,193 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633307, now seen corresponding path program 1 times [2018-01-24 11:44:25,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:25,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:25,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:25,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:25,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:25,297 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:44:25,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:25,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:44:25,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:44:25,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:44:25,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:44:25,298 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-24 11:44:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:25,411 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 11:44:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:44:25,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 11:44:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:25,414 INFO L225 Difference]: With dead ends: 45 [2018-01-24 11:44:25,415 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 11:44:25,415 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:44:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 11:44:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-24 11:44:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:44:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:44:25,422 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-24 11:44:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:25,422 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:44:25,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:44:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:44:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:44:25,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:25,424 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:25,424 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:25,424 INFO L82 PathProgramCache]: Analyzing trace with hash -429040459, now seen corresponding path program 1 times [2018-01-24 11:44:25,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:25,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:25,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:25,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:25,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:25,509 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:44:25,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:25,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:44:25,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:44:25,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:44:25,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:44:25,510 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-24 11:44:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:25,581 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 11:44:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:44:25,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 11:44:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:25,583 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:44:25,583 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 11:44:25,583 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:44:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 11:44:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 11:44:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:44:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 11:44:25,589 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-24 11:44:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:25,590 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 11:44:25,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:44:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 11:44:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:44:25,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:25,591 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:25,591 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash -429040458, now seen corresponding path program 1 times [2018-01-24 11:44:25,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:25,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:25,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:25,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:25,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:25,698 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:44:25,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:25,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:44:25,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:44:25,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:44:25,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:44:25,699 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-24 11:44:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:25,825 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 11:44:25,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:44:25,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 11:44:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:25,826 INFO L225 Difference]: With dead ends: 42 [2018-01-24 11:44:25,826 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 11:44:25,827 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:44:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 11:44:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-24 11:44:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:44:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:44:25,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-24 11:44:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:25,832 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:44:25,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:44:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:44:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:44:25,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:25,833 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:25,833 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash 39867865, now seen corresponding path program 1 times [2018-01-24 11:44:25,834 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:25,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:25,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:25,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:25,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:26,009 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:44:26,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:26,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 11:44:26,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:44:26,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:44:26,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:44:26,011 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-01-24 11:44:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:26,213 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-24 11:44:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:44:26,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-24 11:44:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:26,214 INFO L225 Difference]: With dead ends: 91 [2018-01-24 11:44:26,214 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 11:44:26,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:44:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 11:44:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-01-24 11:44:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:44:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 11:44:26,227 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-01-24 11:44:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:26,227 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 11:44:26,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:44:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 11:44:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:44:26,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:26,228 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:26,228 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1548480037, now seen corresponding path program 1 times [2018-01-24 11:44:26,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:26,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:26,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:26,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:26,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:26,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:26,408 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:44:26,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:26,409 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:44:26,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:26,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:26,493 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:44:26,495 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:44:26,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:26,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:26,502 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:44:26,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:44:26,573 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:44:26,585 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:44:26,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:44:26,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:26,610 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:44:26,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 11:44:26,694 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:44:26,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:26,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-01-24 11:44:26,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:44:26,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:44:26,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:44:26,718 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 16 states. [2018-01-24 11:44:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:27,049 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-24 11:44:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:44:27,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-24 11:44:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:27,050 INFO L225 Difference]: With dead ends: 67 [2018-01-24 11:44:27,051 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 11:44:27,051 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:44:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 11:44:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 11:44:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 11:44:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 11:44:27,062 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-01-24 11:44:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:27,062 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 11:44:27,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:44:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 11:44:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:44:27,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:27,063 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:27,063 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash -758240906, now seen corresponding path program 1 times [2018-01-24 11:44:27,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:27,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:27,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:27,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:27,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:27,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:27,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:27,342 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:44:27,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:27,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:27,371 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:44:27,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:27,377 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:44:27,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:27,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:27,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 11:44:27,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:27,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:27,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:44:27,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:27,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:44:27,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:27,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:27,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 11:44:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:27,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:27,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-24 11:44:27,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:44:27,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:44:27,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:44:27,650 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 22 states. [2018-01-24 11:44:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:28,148 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-24 11:44:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:44:28,149 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-24 11:44:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:28,150 INFO L225 Difference]: With dead ends: 65 [2018-01-24 11:44:28,150 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 11:44:28,150 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:44:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 11:44:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-24 11:44:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:44:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-24 11:44:28,160 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 24 [2018-01-24 11:44:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:28,161 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-24 11:44:28,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:44:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-24 11:44:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:44:28,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:28,162 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:28,162 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash 67945113, now seen corresponding path program 2 times [2018-01-24 11:44:28,162 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:28,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:28,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:28,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:28,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:28,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:28,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:28,465 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:44:28,469 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:44:28,480 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:44:28,485 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:44:28,486 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:44:28,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:28,493 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:44:28,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:44:28,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:28,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:28,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:44:28,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:28,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 11:44:28,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:44:28,554 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:44:28,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 11:44:28,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 11:44:28,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:44:28,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:28,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:44:28,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-24 11:44:28,760 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:44:28,770 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:44:28,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:44:28,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:28,793 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:44:28,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 11:44:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:28,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:28,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-01-24 11:44:28,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:44:28,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:44:28,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:44:28,867 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 20 states. [2018-01-24 11:44:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:29,496 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 11:44:29,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:44:29,496 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-24 11:44:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:29,497 INFO L225 Difference]: With dead ends: 64 [2018-01-24 11:44:29,497 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 11:44:29,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:44:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 11:44:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-01-24 11:44:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:44:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 11:44:29,507 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 28 [2018-01-24 11:44:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:29,507 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 11:44:29,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:44:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 11:44:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:44:29,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:29,509 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:29,509 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 11:44:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1163981862, now seen corresponding path program 1 times [2018-01-24 11:44:29,509 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:29,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:29,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:29,510 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:44:29,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:29,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:29,600 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:44:29,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:29,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:44:29,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:44:29,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:44:29,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:44:29,601 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 6 states. [2018-01-24 11:44:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:29,660 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 11:44:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:44:29,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 11:44:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:29,661 INFO L225 Difference]: With dead ends: 47 [2018-01-24 11:44:29,661 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:44:29,661 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:44:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:44:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:44:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:44:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:44:29,662 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 11:44:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:29,662 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:44:29,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:44:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:44:29,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:44:29,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:44:29,702 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 11:44:30,035 WARN L146 SmtUtils]: Spent 276ms on a formula simplification. DAG size of input: 75 DAG size of output 52 [2018-01-24 11:44:30,188 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-01-24 11:44:30,507 WARN L146 SmtUtils]: Spent 317ms on a formula simplification. DAG size of input: 128 DAG size of output 94 [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,511 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,511 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,511 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point L551'(lines 551 553) no Hoare annotation was computed. [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 545 560) no Hoare annotation was computed. [2018-01-24 11:44:30,511 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 545 560) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 545 560) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 545 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-24 11:44:30,512 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L397 ceAbstractionStarter]: At program point L557'(line 557) the Hoare annotation is: (let ((.cse1 (select |#length| |main_#t~malloc7.base|)) (.cse0 (select |#length| main_~nondetString~4.base))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= .cse0 main_~length2~4) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ main_~nondetString~4.offset .cse0 (- 1)))) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L397 ceAbstractionStarter]: At program point cstpcpyENTRY(lines 540 544) the Hoare annotation is: (let ((.cse8 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse0 (not (= 0 |cstpcpy_#in~to.offset|))) (.cse1 (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstpcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstpcpy_#in~from.offset|))))) (.cse2 (not (= 0 |cstpcpy_#in~from.offset|))) (.cse3 (not (= (select |#valid| |cstpcpy_#in~to.base|) 1))) (.cse4 (not (= 1 (select |#valid| |cstpcpy_#in~from.base|)))) (.cse5 (< .cse8 1)) (.cse6 (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|)) (.cse7 (< (select |#length| |cstpcpy_#in~to.base|) .cse8))) (and (or (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstpcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstpcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstpcpy_#in~from.offset|))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (not (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|) 0)) .cse4 .cse5 .cse6 (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|)) .cse7)))) [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:44:30,513 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-24 11:44:30,514 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-24 11:44:30,514 INFO L401 ceAbstractionStarter]: For program point cstpcpyEXIT(lines 540 544) no Hoare annotation was computed. [2018-01-24 11:44:30,514 INFO L401 ceAbstractionStarter]: For program point cstpcpyFINAL(lines 540 544) no Hoare annotation was computed. [2018-01-24 11:44:30,514 INFO L397 ceAbstractionStarter]: At program point L542'''''(line 542) the Hoare annotation is: (let ((.cse18 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse0 (not (= 0 |cstpcpy_#in~to.offset|))) (.cse2 (not (= 0 |cstpcpy_#in~from.offset|))) (.cse3 (not (= (select |#valid| |cstpcpy_#in~to.base|) 1))) (.cse4 (not (= 1 (select |#valid| |cstpcpy_#in~from.base|)))) (.cse5 (< .cse18 1)) (.cse7 (= cstpcpy_~from.offset 0)) (.cse1 (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstpcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstpcpy_#in~from.offset|))))) (.cse6 (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|)) (.cse8 (< (select |#length| |cstpcpy_#in~to.base|) .cse18))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|) 0)) .cse4 .cse5 .cse6 (and (= 0 (select (select |#memory_int| cstpcpy_~from.base) cstpcpy_~from.offset)) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|)) .cse7) .cse8) (let ((.cse13 (select |#length| cstpcpy_~from.base)) (.cse14 (select |#length| cstpcpy_~to.base))) (let ((.cse9 (= 1 (select |#valid| cstpcpy_~to.base))) (.cse10 (= 1 (select |#valid| cstpcpy_~from.base))) (.cse11 (not (= cstpcpy_~from.base cstpcpy_~to.base))) (.cse17 (<= .cse13 .cse14)) (.cse12 (<= (+ cstpcpy_~from.offset 1) .cse13)) (.cse15 (<= 1 cstpcpy_~to.offset)) (.cse16 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| cstpcpy_~from.base) (+ (select |#length| cstpcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1)))) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 1) cstpcpy_~from.offset))))) (or .cse0 .cse2 (and .cse9 .cse10 .cse11 .cse12 (<= (+ .cse13 cstpcpy_~to.offset) (+ .cse14 cstpcpy_~from.offset)) .cse15 .cse16 (<= 2 cstpcpy_~from.offset)) .cse3 .cse4 .cse5 (and (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstpcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstpcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstpcpy_#in~from.offset|))) (= cstpcpy_~to.offset 0) .cse9 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| cstpcpy_~from.base) (+ (select |#length| cstpcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1)))) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 cstpcpy_~from.offset))) .cse10 .cse11 (<= 1 .cse13) .cse17 .cse7) (and .cse9 (<= cstpcpy_~to.offset 1) .cse10 .cse11 .cse17 .cse12 .cse15 .cse16) .cse1 .cse6 .cse8)))))) [2018-01-24 11:44:30,523 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,524 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,524 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,524 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,530 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:44:30 BoogieIcfgContainer [2018-01-24 11:44:30,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:44:30,568 INFO L168 Benchmark]: Toolchain (without parser) took 6873.15 ms. Allocated memory was 302.5 MB in the beginning and 546.3 MB in the end (delta: 243.8 MB). Free memory was 262.6 MB in the beginning and 392.3 MB in the end (delta: -129.8 MB). Peak memory consumption was 191.9 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:30,570 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:44:30,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.08 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:30,570 INFO L168 Benchmark]: Boogie Preprocessor took 28.86 ms. Allocated memory is still 302.5 MB. Free memory was 251.3 MB in the beginning and 250.3 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-24 11:44:30,571 INFO L168 Benchmark]: RCFGBuilder took 219.26 ms. Allocated memory is still 302.5 MB. Free memory was 250.3 MB in the beginning and 233.4 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:30,571 INFO L168 Benchmark]: TraceAbstraction took 6415.98 ms. Allocated memory was 302.5 MB in the beginning and 546.3 MB in the end (delta: 243.8 MB). Free memory was 233.4 MB in the beginning and 392.3 MB in the end (delta: -158.9 MB). Peak memory consumption was 162.7 MB. Max. memory is 5.3 GB. [2018-01-24 11:44:30,573 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.08 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.86 ms. Allocated memory is still 302.5 MB. Free memory was 251.3 MB in the beginning and 250.3 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 219.26 ms. Allocated memory is still 302.5 MB. Free memory was 250.3 MB in the beginning and 233.4 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6415.98 ms. Allocated memory was 302.5 MB in the beginning and 546.3 MB in the end (delta: 243.8 MB). Free memory was 233.4 MB in the beginning and 392.3 MB in the end (delta: -158.9 MB). Peak memory consumption was 162.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 545]: 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 - 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 - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 542]: Loop Invariant [2018-01-24 11:44:30,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,599 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,603 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,603 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,603 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,603 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:44:30,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:44:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:44:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((!(0 == to) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((\old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from)) || !(0 == from)) || !(\valid[to] == 1)) || !(\old(unknown-#memory_int-unknown)[from][from] == 0)) || !(1 == \valid[from])) || unknown-#length-unknown[from] < 1) || from == to) || ((0 == unknown-#memory_int-unknown[from][from] && 0 == unknown-#memory_int-unknown[from][from]) && from == 0)) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) && ((((((((((!(0 == to) || !(0 == from)) || (((((((1 == \valid[to] && 1 == \valid[from]) && !(from == to)) && from + 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] + to <= unknown-#length-unknown[to] + from) && 1 <= to) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && v_main_~nondetString~4.offset_BEFORE_CALL_2 + 1 <= from)) && 2 <= from)) || !(\valid[to] == 1)) || !(1 == \valid[from])) || unknown-#length-unknown[from] < 1) || (((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && to == 0) && 1 == \valid[to]) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from)) && 1 == \valid[from]) && !(from == to)) && 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && from == 0)) || (((((((1 == \valid[to] && to <= 1) && 1 == \valid[from]) && !(from == to)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && from + 1 <= unknown-#length-unknown[from]) && 1 <= to) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && v_main_~nondetString~4.offset_BEFORE_CALL_2 + 1 <= from))) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((\old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from)) || from == to) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 6.3s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 493 SDslu, 1401 SDs, 0 SdLazy, 1355 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 624 HoareAnnotationTreeSize, 9 FomulaSimplifications, 293 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 704 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 299 ConstructedInterpolants, 13 QuantifiedInterpolants, 51696 SizeOfPredicates, 27 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 2/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-44-30-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-44-30-618.csv Received shutdown request...