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_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:45:27,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:45:27,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:45:27,438 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:45:27,438 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:45:27,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:45:27,439 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:45:27,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:45:27,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:45:27,443 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:45:27,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:45:27,443 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:45:27,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:45:27,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:45:27,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:45:27,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:45:27,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:45:27,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:45:27,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:45:27,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:45:27,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:45:27,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:45:27,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:45:27,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:45:27,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:45:27,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:45:27,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:45:27,462 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:45:27,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:45:27,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:45:27,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:45:27,464 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:45:27,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:45:27,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:45:27,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:45:27,475 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:45:27,475 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:45:27,475 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:45:27,475 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:45:27,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:45:27,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:45:27,476 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:45:27,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:45:27,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:45:27,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:45:27,477 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:45:27,477 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:45:27,477 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:45:27,477 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:45:27,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:45:27,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:45:27,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:45:27,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:45:27,478 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:45:27,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:45:27,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:45:27,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:45:27,479 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:45:27,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:45:27,480 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:45:27,480 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:45:27,480 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:45:27,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:45:27,480 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:45:27,481 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:45:27,481 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:45:27,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:45:27,529 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:45:27,534 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:45:27,535 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:45:27,536 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:45:27,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:45:27,727 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:45:27,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:45:27,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:45:27,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:45:27,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:45:27,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3565d9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27, skipping insertion in model container [2018-01-24 11:45:27,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,756 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:45:27,793 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:45:27,901 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:45:27,916 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:45:27,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27 WrapperNode [2018-01-24 11:45:27,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:45:27,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:45:27,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:45:27,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:45:27,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... [2018-01-24 11:45:27,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:45:27,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:45:27,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:45:27,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:45:27,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:45:28,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:45:28,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:45:28,003 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-24 11:45:28,004 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:45:28,004 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:45:28,004 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:45:28,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:45:28,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:45:28,004 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:45:28,005 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:45:28,005 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-24 11:45:28,005 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:45:28,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:45:28,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:45:28,208 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:45:28,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:45:28 BoogieIcfgContainer [2018-01-24 11:45:28,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:45:28,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:45:28,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:45:28,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:45:28,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:45:27" (1/3) ... [2018-01-24 11:45:28,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a05e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:45:28, skipping insertion in model container [2018-01-24 11:45:28,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:27" (2/3) ... [2018-01-24 11:45:28,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a05e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:45:28, skipping insertion in model container [2018-01-24 11:45:28,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:45:28" (3/3) ... [2018-01-24 11:45:28,214 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:45:28,221 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:45:28,228 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 11:45:28,264 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:45:28,265 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:45:28,265 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:45:28,265 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:45:28,265 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:45:28,265 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:45:28,265 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:45:28,265 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:45:28,266 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:45:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-24 11:45:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:45:28,292 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:28,293 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:28,294 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:28,299 INFO L82 PathProgramCache]: Analyzing trace with hash 955833556, now seen corresponding path program 1 times [2018-01-24 11:45:28,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:28,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:28,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:28,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:28,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:28,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:28,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:28,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:45:28,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:45:28,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:45:28,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:45:28,575 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-24 11:45:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:28,746 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-24 11:45:28,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:45:28,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 11:45:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:28,759 INFO L225 Difference]: With dead ends: 73 [2018-01-24 11:45:28,759 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:45:28,763 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:45:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 11:45:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:45:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 11:45:28,802 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2018-01-24 11:45:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:28,802 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 11:45:28,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:45:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 11:45:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:45:28,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:28,804 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:28,804 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash 955833557, now seen corresponding path program 1 times [2018-01-24 11:45:28,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:28,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:28,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:28,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:28,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:28,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:28,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:28,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:45:28,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:45:28,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:45:28,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:28,968 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-24 11:45:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:29,052 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-01-24 11:45:29,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:45:29,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 11:45:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:29,054 INFO L225 Difference]: With dead ends: 49 [2018-01-24 11:45:29,054 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:45:29,055 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:45:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:45:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 11:45:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 11:45:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-24 11:45:29,062 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-01-24 11:45:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:29,062 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-24 11:45:29,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:45:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-24 11:45:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:45:29,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:29,063 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:29,063 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:29,063 INFO L82 PathProgramCache]: Analyzing trace with hash -433930803, now seen corresponding path program 1 times [2018-01-24 11:45:29,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:29,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:29,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:29,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:29,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:45:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:29,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:29,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:45:29,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:45:29,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:45:29,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:29,154 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2018-01-24 11:45:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:29,226 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 11:45:29,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:45:29,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:45:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:29,228 INFO L225 Difference]: With dead ends: 48 [2018-01-24 11:45:29,228 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:45:29,228 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:45:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:45:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 11:45:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:45:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 11:45:29,235 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-01-24 11:45:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:29,235 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 11:45:29,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:45:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 11:45:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:45:29,236 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:29,237 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:29,237 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash -433930804, now seen corresponding path program 1 times [2018-01-24 11:45:29,237 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:29,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:29,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:29,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:29,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:29,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:29,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:45:29,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:45:29,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:45:29,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:45:29,278 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-01-24 11:45:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:29,330 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 11:45:29,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:45:29,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:45:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:29,331 INFO L225 Difference]: With dead ends: 47 [2018-01-24 11:45:29,331 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 11:45:29,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 11:45:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 11:45:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:45:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 11:45:29,336 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2018-01-24 11:45:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:29,336 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 11:45:29,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:45:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 11:45:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 11:45:29,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:29,337 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:29,337 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852195, now seen corresponding path program 1 times [2018-01-24 11:45:29,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:29,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:29,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:29,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:29,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:29,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:29,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:45:29,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:45:29,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:45:29,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:45:29,390 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-24 11:45:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:29,469 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 11:45:29,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:45:29,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 11:45:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:29,470 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:45:29,470 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 11:45:29,470 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 11:45:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 11:45:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 11:45:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-01-24 11:45:29,476 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 18 [2018-01-24 11:45:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:29,477 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-01-24 11:45:29,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:45:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-01-24 11:45:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 11:45:29,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:29,478 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:29,478 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852196, now seen corresponding path program 1 times [2018-01-24 11:45:29,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:29,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:29,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:29,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:29,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:29,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:29,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:45:29,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:45:29,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:45:29,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:29,583 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-01-24 11:45:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:29,686 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 11:45:29,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:45:29,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 11:45:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:29,690 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:45:29,690 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 11:45:29,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:45:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 11:45:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2018-01-24 11:45:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:45:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 11:45:29,697 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-01-24 11:45:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:29,698 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 11:45:29,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:45:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 11:45:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:45:29,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:29,699 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] [2018-01-24 11:45:29,699 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324412, now seen corresponding path program 1 times [2018-01-24 11:45:29,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:29,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:29,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:29,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:29,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:29,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:29,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:45:29,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:45:29,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:45:29,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:29,760 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-01-24 11:45:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:29,838 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 11:45:29,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:45:29,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 11:45:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:29,839 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:45:29,839 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:45:29,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:45:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 11:45:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:45:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 11:45:29,846 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2018-01-24 11:45:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:29,846 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 11:45:29,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:45:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 11:45:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:45:29,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:29,847 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] [2018-01-24 11:45:29,847 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324411, now seen corresponding path program 1 times [2018-01-24 11:45:29,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:29,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:29,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:29,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:29,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:29,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:29,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:45:29,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:45:29,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:45:29,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:45:29,966 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2018-01-24 11:45:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:30,118 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 11:45:30,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:45:30,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 11:45:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:30,119 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:45:30,119 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:45:30,119 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:45:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:45:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 11:45:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:45:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 11:45:30,123 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-01-24 11:45:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:30,124 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 11:45:30,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:45:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 11:45:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:45:30,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:30,125 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] [2018-01-24 11:45:30,126 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951781, now seen corresponding path program 1 times [2018-01-24 11:45:30,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:30,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:30,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:30,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:30,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:30,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:30,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:45:30,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:45:30,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:45:30,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:30,189 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-24 11:45:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:30,240 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 11:45:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:45:30,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 11:45:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:30,241 INFO L225 Difference]: With dead ends: 49 [2018-01-24 11:45:30,242 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:45:30,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:45:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 11:45:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 11:45:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-24 11:45:30,248 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-01-24 11:45:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:30,248 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-24 11:45:30,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:45:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-24 11:45:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:45:30,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:30,249 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] [2018-01-24 11:45:30,249 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951782, now seen corresponding path program 1 times [2018-01-24 11:45:30,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:30,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:30,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:30,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:30,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:30,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:30,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:45:30,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:45:30,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:45:30,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:30,444 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-01-24 11:45:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:30,669 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-24 11:45:30,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:45:30,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 11:45:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:30,670 INFO L225 Difference]: With dead ends: 58 [2018-01-24 11:45:30,670 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 11:45:30,671 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:45:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 11:45:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-01-24 11:45:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:45:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 11:45:30,675 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2018-01-24 11:45:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:30,675 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 11:45:30,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:45:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 11:45:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:45:30,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:30,676 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] [2018-01-24 11:45:30,676 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash -645685358, now seen corresponding path program 1 times [2018-01-24 11:45:30,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:30,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:30,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:30,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:30,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:30,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:30,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:45:30,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:45:30,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:45:30,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:30,719 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-24 11:45:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:30,764 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 11:45:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:45:30,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 11:45:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:30,765 INFO L225 Difference]: With dead ends: 49 [2018-01-24 11:45:30,765 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:45:30,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:45:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:45:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 11:45:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 11:45:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-24 11:45:30,769 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2018-01-24 11:45:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:30,769 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-24 11:45:30,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:45:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-24 11:45:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:45:30,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:30,770 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] [2018-01-24 11:45:30,770 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash -645685357, now seen corresponding path program 1 times [2018-01-24 11:45:30,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:30,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:30,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:30,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:30,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:30,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:30,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:45:30,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:45:30,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:45:30,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:45:30,899 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-01-24 11:45:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:31,065 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-24 11:45:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:45:31,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 11:45:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:31,066 INFO L225 Difference]: With dead ends: 58 [2018-01-24 11:45:31,066 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 11:45:31,067 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:45:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 11:45:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-01-24 11:45:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:45:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 11:45:31,070 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2018-01-24 11:45:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:31,070 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 11:45:31,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:45:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 11:45:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:45:31,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:31,071 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, 1, 1] [2018-01-24 11:45:31,071 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1460131898, now seen corresponding path program 1 times [2018-01-24 11:45:31,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:31,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:31,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:31,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:31,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:31,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:31,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:31,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 11:45:31,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:45:31,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:45:31,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:45:31,331 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-01-24 11:45:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:31,590 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-24 11:45:31,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:45:31,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-01-24 11:45:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:31,591 INFO L225 Difference]: With dead ends: 106 [2018-01-24 11:45:31,591 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 11:45:31,591 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:45:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 11:45:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-01-24 11:45:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 11:45:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-24 11:45:31,597 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-01-24 11:45:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:31,597 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-24 11:45:31,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:45:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-24 11:45:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:45:31,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:31,598 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, 1, 1] [2018-01-24 11:45:31,598 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash -228811844, now seen corresponding path program 1 times [2018-01-24 11:45:31,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:31,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:31,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:31,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:31,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:31,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:31,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:31,795 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:31,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:31,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:31,898 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 11 treesize of output 8 [2018-01-24 11:45:31,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:45:31,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:31,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:31,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:31,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 11:45:32,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-24 11:45:32,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 15 [2018-01-24 11:45:32,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:32,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 8 [2018-01-24 11:45:32,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:32,225 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 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-24 11:45:32,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:32,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:32,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:32,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-01-24 11:45:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:32,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:45:32,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2018-01-24 11:45:32,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:45:32,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:45:32,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:45:32,271 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 22 states. [2018-01-24 11:45:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:33,421 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2018-01-24 11:45:33,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 11:45:33,422 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-01-24 11:45:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:33,423 INFO L225 Difference]: With dead ends: 169 [2018-01-24 11:45:33,424 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 11:45:33,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=2058, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 11:45:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 11:45:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2018-01-24 11:45:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 11:45:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-01-24 11:45:33,434 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 25 [2018-01-24 11:45:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:33,434 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-01-24 11:45:33,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:45:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-01-24 11:45:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:45:33,435 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:33,435 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:33,436 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:33,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1662500005, now seen corresponding path program 1 times [2018-01-24 11:45:33,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:33,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:33,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:33,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:33,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:33,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:34,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:34,001 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:34,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:34,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:34,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:34,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:34,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:34,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:34,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:34,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:45:34,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-24 11:45:34,405 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 27 treesize of output 25 [2018-01-24 11:45:34,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:34,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-24 11:45:34,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:34,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 14 [2018-01-24 11:45:34,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:34,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:45:34,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:34,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-24 11:45:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:34,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:34,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-01-24 11:45:34,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 11:45:34,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 11:45:34,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:45:34,553 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 23 states. [2018-01-24 11:45:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:36,880 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-24 11:45:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:45:36,881 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-01-24 11:45:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:36,881 INFO L225 Difference]: With dead ends: 80 [2018-01-24 11:45:36,881 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 11:45:36,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=1043, Unknown=2, NotChecked=0, Total=1190 [2018-01-24 11:45:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 11:45:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-24 11:45:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 11:45:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 11:45:36,889 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 27 [2018-01-24 11:45:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:36,889 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 11:45:36,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 11:45:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 11:45:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:45:36,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:36,891 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:36,891 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 65327996, now seen corresponding path program 1 times [2018-01-24 11:45:36,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:36,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:36,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:36,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:36,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:36,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:36,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:36,984 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:36,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:37,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:37,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:37,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2018-01-24 11:45:37,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:45:37,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:45:37,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:45:37,052 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 11 states. [2018-01-24 11:45:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:37,194 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-24 11:45:37,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:45:37,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-01-24 11:45:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:37,196 INFO L225 Difference]: With dead ends: 86 [2018-01-24 11:45:37,196 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 11:45:37,196 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:45:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 11:45:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-01-24 11:45:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 11:45:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 11:45:37,205 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 29 [2018-01-24 11:45:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:37,205 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 11:45:37,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:45:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 11:45:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:45:37,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:37,207 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, 1, 1] [2018-01-24 11:45:37,207 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash -580377695, now seen corresponding path program 1 times [2018-01-24 11:45:37,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:37,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:37,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:37,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:37,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:37,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:37,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:37,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:45:37,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:45:37,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:45:37,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:45:37,378 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2018-01-24 11:45:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:37,457 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-01-24 11:45:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:45:37,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 11:45:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:37,457 INFO L225 Difference]: With dead ends: 75 [2018-01-24 11:45:37,458 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 11:45:37,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:45:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 11:45:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 11:45:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 11:45:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-24 11:45:37,461 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2018-01-24 11:45:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:37,461 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-24 11:45:37,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:45:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-24 11:45:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:45:37,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:37,462 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:37,462 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1644356119, now seen corresponding path program 1 times [2018-01-24 11:45:37,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:37,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:37,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:37,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:37,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:37,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:37,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:37,647 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:37,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:37,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:37,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:45:37,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2018-01-24 11:45:37,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:45:37,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:45:37,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:45:37,743 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 14 states. [2018-01-24 11:45:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:37,898 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-01-24 11:45:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:45:37,898 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-01-24 11:45:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:37,899 INFO L225 Difference]: With dead ends: 40 [2018-01-24 11:45:37,899 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:45:37,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:45:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:45:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 11:45:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:45:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-24 11:45:37,904 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2018-01-24 11:45:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:37,904 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-24 11:45:37,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:45:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-24 11:45:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:45:37,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:37,905 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:37,905 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash 566109348, now seen corresponding path program 1 times [2018-01-24 11:45:37,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:37,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:37,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:37,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:37,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:37,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:38,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:38,281 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:38,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:38,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:38,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:38,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:38,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:45:38,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:38,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:45:38,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:38,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:38,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:38,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 11:45:38,393 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 15 treesize of output 12 [2018-01-24 11:45:38,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 11:45:38,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 11:45:38,423 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 28 treesize of output 29 [2018-01-24 11:45:38,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:45:38,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:38,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-24 11:45:38,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-01-24 11:45:38,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2018-01-24 11:45:38,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:38,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-24 11:45:38,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:38,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:38,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:38,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-01-24 11:45:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:38,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:38,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-01-24 11:45:38,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 11:45:38,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 11:45:38,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:45:38,822 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2018-01-24 11:45:39,388 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 52 DAG size of output 39 [2018-01-24 11:45:41,470 WARN L146 SmtUtils]: Spent 2056ms on a formula simplification. DAG size of input: 53 DAG size of output 40 [2018-01-24 11:45:43,613 WARN L146 SmtUtils]: Spent 2047ms on a formula simplification. DAG size of input: 49 DAG size of output 39 [2018-01-24 11:45:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:46,665 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-01-24 11:45:46,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:45:46,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-01-24 11:45:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:46,666 INFO L225 Difference]: With dead ends: 37 [2018-01-24 11:45:46,667 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:45:46,667 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 11:45:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:45:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-01-24 11:45:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:45:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-01-24 11:45:46,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-01-24 11:45:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:46,673 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-01-24 11:45:46,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 11:45:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-01-24 11:45:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:45:46,674 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:46,674 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:46,674 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1429764731, now seen corresponding path program 2 times [2018-01-24 11:45:46,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:46,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:46,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:46,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:46,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:46,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:47,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:47,088 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:47,100 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:45:47,118 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:47,127 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:47,138 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:47,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:47,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:47,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:47,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:47,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:45:47,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:45:47,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:45:47,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:47,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:47,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:47,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-01-24 11:45:47,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-24 11:45:47,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 22 [2018-01-24 11:45:47,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:47,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 11:45:47,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:47,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-01-24 11:45:47,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:47,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:45:47,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:47,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-24 11:45:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:47,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:47,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-01-24 11:45:47,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 11:45:47,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 11:45:47,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:45:47,635 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2018-01-24 11:45:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:48,449 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-01-24 11:45:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:45:48,450 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-01-24 11:45:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:48,450 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:45:48,450 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:45:48,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:45:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:45:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:45:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:45:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:45:48,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-24 11:45:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:48,451 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:45:48,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 11:45:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:45:48,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:45:48,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:45:56,809 WARN L146 SmtUtils]: Spent 8213ms on a formula simplification. DAG size of input: 154 DAG size of output 140 [2018-01-24 11:45:57,465 WARN L146 SmtUtils]: Spent 655ms on a formula simplification. DAG size of input: 106 DAG size of output 91 [2018-01-24 11:45:57,521 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:45:57,522 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr6RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,522 INFO L397 ceAbstractionStarter]: At program point L543'''''(lines 543 545) the Hoare annotation is: (let ((.cse3 (select |#length| cstrcmp_~s1.base)) (.cse13 (select |#length| |cstrcmp_#in~s1.base|))) (let ((.cse14 (not (= 0 |cstrcmp_#in~s2.offset|))) (.cse11 (< .cse13 1)) (.cse12 (not (= 1 (select |#valid| |cstrcmp_#in~s2.base|)))) (.cse16 (not (= 0 |cstrcmp_#in~s1.offset|))) (.cse0 (= 0 cstrcmp_~s2.offset)) (.cse5 (<= 1 .cse3)) (.cse6 (= cstrcmp_~s1.offset 0)) (.cse10 (not (= (select |#valid| |cstrcmp_#in~s1.base|) 1))) (.cse17 (select |#memory_int| |cstrcmp_#in~s1.base|)) (.cse15 (not (exists ((main_~length2~3 Int) (v_main_~nondetString2~3.offset_BEFORE_CALL_2 Int)) (and (<= |cstrcmp_#in~s2.offset| v_main_~nondetString2~3.offset_BEFORE_CALL_2) (<= 1 main_~length2~3) (<= (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_2) (select |#length| |cstrcmp_#in~s2.base|)) (= (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_2 (- 1))) 0))))) (.cse1 (= 1 (select |#valid| cstrcmp_~s2.base))) (.cse2 (= 1 (select |#valid| cstrcmp_~s1.base))) (.cse9 (select |#memory_int| cstrcmp_~s1.base))) (and (let ((.cse8 (select .cse17 |cstrcmp_#in~s1.offset|)) (.cse7 (= (select (select |#memory_int| |cstrcmp_#in~s2.base|) |cstrcmp_#in~s2.offset|) 0))) (or (and .cse0 (exists ((main_~length2~3 Int) (v_main_~nondetString2~3.offset_BEFORE_CALL_2 Int)) (and (<= cstrcmp_~s2.offset v_main_~nondetString2~3.offset_BEFORE_CALL_2) (<= (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_2) (select |#length| cstrcmp_~s2.base)) (<= 1 main_~length2~3) (= (select (select |#memory_int| cstrcmp_~s2.base) (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_2 (- 1))) 0))) (let ((.cse4 (= 0 (select .cse9 cstrcmp_~s1.offset)))) (or (and .cse1 .cse2 (or (<= 2 .cse3) .cse4) .cse5 .cse6 .cse7 (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and .cse1 .cse2 .cse5 .cse6 .cse4 (= 0 .cse8))))) (and (or .cse10 (not (= .cse8 0)) .cse11 .cse12) (or (not .cse7) .cse10 .cse12 (< .cse13 2))) .cse14 .cse15 .cse16)) (let ((.cse21 (select |#length| cstrcmp_~s2.base))) (let ((.cse18 (<= (+ cstrcmp_~s2.offset 1) .cse21)) (.cse19 (= 0 (select .cse9 (+ .cse3 (- 1))))) (.cse20 (exists ((main_~nondetString2~3.offset Int)) (and (<= 0 main_~nondetString2~3.offset) (<= main_~nondetString2~3.offset 0) (= (select (select |#memory_int| cstrcmp_~s2.base) (+ (select |#length| cstrcmp_~s2.base) main_~nondetString2~3.offset (- 1))) 0))))) (or (and .cse1 .cse2 (<= 2 cstrcmp_~s1.offset) .cse18 .cse19 (not (= .cse3 cstrcmp_~s1.offset)) (<= cstrcmp_~s1.offset .cse3) (<= 2 cstrcmp_~s2.offset) .cse20) .cse14 .cse11 .cse12 (not (exists ((main_~nondetString2~3.base Int) (main_~nondetString2~3.offset Int)) (and (= (select (select |#memory_int| main_~nondetString2~3.base) (+ (select |#length| main_~nondetString2~3.base) main_~nondetString2~3.offset (- 1))) 0) (not (= main_~nondetString2~3.base |cstrcmp_#in~s1.base|))))) .cse16 (not (exists ((main_~nondetString2~3.offset Int)) (and (<= 0 main_~nondetString2~3.offset) (<= main_~nondetString2~3.offset 0) (= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ (select |#length| |cstrcmp_#in~s2.base|) main_~nondetString2~3.offset (- 1))))))) (and .cse1 .cse2 .cse0 (<= 1 .cse21) .cse5 .cse6 .cse19 .cse20) .cse10 (not (= 0 (select .cse17 (+ .cse13 (- 1))))) .cse15 (and .cse1 (<= (+ cstrcmp_~s1.offset 1) .cse3) .cse2 (or (= 1 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) .cse3)) (or (<= (+ cstrcmp_~s2.offset 2) .cse21) (<= cstrcmp_~s2.offset 1)) .cse18 (<= 1 cstrcmp_~s2.offset) .cse19 (<= 1 cstrcmp_~s1.offset) .cse20))))))) [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point L543''''''(lines 543 545) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr5RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L404 ceAbstractionStarter]: At program point cstrcmpENTRY(lines 540 547) the Hoare annotation is: true [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr8RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr9RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr7RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point cstrcmpErr4RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-24 11:45:57,523 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 11:45:57,524 INFO L401 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-24 11:45:57,524 INFO L401 ceAbstractionStarter]: For program point cstrcmpEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 11:45:57,524 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-24 11:45:57,524 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,524 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-24 11:45:57,524 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,524 INFO L397 ceAbstractionStarter]: At program point L560(line 560) the Hoare annotation is: (let ((.cse3 (select |#length| main_~nondetString1~3.base))) (let ((.cse8 (= 0 |main_#t~malloc10.offset|)) (.cse0 (= 0 |main_#t~malloc11.offset|)) (.cse1 (= main_~length1~3 (select |#length| |main_#t~malloc10.base|))) (.cse9 (<= (+ main_~nondetString1~3.offset 1) .cse3)) (.cse2 (= 1 (select |#valid| main_~nondetString2~3.base))) (.cse10 (= 1 (select |#valid| main_~nondetString1~3.base))) (.cse6 (= 1 (select |#valid| |main_#t~malloc11.base|))) (.cse11 (= main_~length2~3 (select |#length| |main_#t~malloc11.base|))) (.cse7 (= (select |#valid| |main_#t~malloc10.base|) 1)) (.cse5 (select |#length| main_~nondetString2~3.base)) (.cse4 (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|))) (.cse12 (= 0 main_~nondetString1~3.offset)) (.cse13 (= 0 main_~nondetString2~3.offset)) (.cse14 (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0)))) (or (and .cse0 .cse1 (exists ((main_~nondetString2~3.offset Int)) (and (<= 0 main_~nondetString2~3.offset) (<= main_~nondetString2~3.offset 0) (= (select (select |#memory_int| main_~nondetString2~3.base) (+ (select |#length| main_~nondetString2~3.base) main_~nondetString2~3.offset (- 1))) 0))) .cse2 (= 0 (select (select |#memory_int| main_~nondetString1~3.base) (+ .cse3 (- 1)))) .cse4 (= .cse5 main_~length2~3) (not (= main_~nondetString2~3.base main_~nondetString1~3.base)) .cse6 .cse7 .cse8 (= .cse3 main_~length1~3) .cse9 (not (= |main_#t~malloc11.base| main_~nondetString1~3.base)) .cse10 (<= 1 main_~length2~3) .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (= main_~length1~3 .cse3)) (.cse16 (= main_~length2~3 .cse5))) (or (and .cse8 .cse0 .cse1 .cse2 .cse15 (<= 2 .cse3) .cse16 .cse10 .cse6 .cse11 (= 1 main_~length2~3) .cse7) (and (<= (+ main_~length1~3 main_~nondetString1~3.offset) 1) .cse8 .cse0 .cse1 .cse9 .cse2 .cse15 .cse16 (= 0 (select (select (store |#memory_int| main_~nondetString2~3.base (store (select |#memory_int| main_~nondetString2~3.base) (+ main_~nondetString2~3.offset main_~length2~3 (- 1)) 0)) main_~nondetString1~3.base) main_~nondetString1~3.offset)) (not (= main_~nondetString1~3.base main_~nondetString2~3.base)) (not (= main_~nondetString1~3.base |main_#t~malloc11.base|)) .cse10 .cse6 .cse11 .cse7))) (exists ((main_~length2~3 Int)) (and (<= (+ main_~length2~3 main_~nondetString2~3.offset) (select |#length| main_~nondetString2~3.base)) (= 0 (select (select |#memory_int| main_~nondetString2~3.base) (+ main_~length2~3 main_~nondetString2~3.offset (- 1)))) (<= 1 main_~length2~3))) .cse4 .cse12 .cse13 .cse14)))) [2018-01-24 11:45:57,524 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,524 INFO L401 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 11:45:57,525 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 562) no Hoare annotation was computed. [2018-01-24 11:45:57,526 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 548 562) no Hoare annotation was computed. [2018-01-24 11:45:57,526 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 11:45:57,526 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 11:45:57,526 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 562) no Hoare annotation was computed. [2018-01-24 11:45:57,526 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:45:57,526 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 11:45:57,526 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 11:45:57,526 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 11:45:57,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,571 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,571 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,571 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:45:57 BoogieIcfgContainer [2018-01-24 11:45:57,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:45:57,595 INFO L168 Benchmark]: Toolchain (without parser) took 29867.01 ms. Allocated memory was 301.5 MB in the beginning and 592.4 MB in the end (delta: 291.0 MB). Free memory was 261.4 MB in the beginning and 476.8 MB in the end (delta: -215.5 MB). Peak memory consumption was 239.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:57,597 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:45:57,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.36 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 250.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:57,597 INFO L168 Benchmark]: Boogie Preprocessor took 35.98 ms. Allocated memory is still 301.5 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:57,598 INFO L168 Benchmark]: RCFGBuilder took 248.81 ms. Allocated memory is still 301.5 MB. Free memory was 248.2 MB in the beginning and 230.1 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:57,598 INFO L168 Benchmark]: TraceAbstraction took 29384.49 ms. Allocated memory was 301.5 MB in the beginning and 592.4 MB in the end (delta: 291.0 MB). Free memory was 229.1 MB in the beginning and 476.8 MB in the end (delta: -247.7 MB). Peak memory consumption was 207.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:57,600 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.23 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 190.36 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 250.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.98 ms. Allocated memory is still 301.5 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 248.81 ms. Allocated memory is still 301.5 MB. Free memory was 248.2 MB in the beginning and 230.1 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 29384.49 ms. Allocated memory was 301.5 MB in the beginning and 592.4 MB in the end (delta: 291.0 MB). Free memory was 229.1 MB in the beginning and 476.8 MB in the end (delta: -247.7 MB). Peak memory consumption was 207.0 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_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 11:45:57,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-24 11:45:57,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-24 11:45:57,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:45:57,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-24 11:45:57,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:45:57,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:45:57,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((0 == s2 && (\exists main_~length2~3 : int, v_main_~nondetString2~3.offset_BEFORE_CALL_2 : int :: ((s2 <= v_main_~nondetString2~3.offset_BEFORE_CALL_2 && main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s2]) && 1 <= main_~length2~3) && unknown-#memory_int-unknown[s2][main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 + -1] == 0)) && (((((((1 == \valid[s2] && 1 == \valid[s1]) && (2 <= unknown-#length-unknown[s1] || 0 == unknown-#memory_int-unknown[s1][s1])) && 1 <= unknown-#length-unknown[s1]) && s1 == 0) && unknown-#memory_int-unknown[s2][s2] == 0) && 0 == unknown-#memory_int-unknown[s2][s2]) || (((((1 == \valid[s2] && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && s1 == 0) && 0 == unknown-#memory_int-unknown[s1][s1]) && 0 == unknown-#memory_int-unknown[s1][s1]))) || ((((!(\valid[s1] == 1) || !(unknown-#memory_int-unknown[s1][s1] == 0)) || unknown-#length-unknown[s1] < 1) || !(1 == \valid[s2])) && (((!(unknown-#memory_int-unknown[s2][s2] == 0) || !(\valid[s1] == 1)) || !(1 == \valid[s2])) || unknown-#length-unknown[s1] < 2))) || !(0 == s2)) || !(\exists main_~length2~3 : int, v_main_~nondetString2~3.offset_BEFORE_CALL_2 : int :: ((s2 <= v_main_~nondetString2~3.offset_BEFORE_CALL_2 && 1 <= main_~length2~3) && main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s2]) && unknown-#memory_int-unknown[s2][main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 + -1] == 0)) || !(0 == s1)) && (((((((((((((((((((1 == \valid[s2] && 1 == \valid[s1]) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && !(unknown-#length-unknown[s1] == s1)) && s1 <= unknown-#length-unknown[s1]) && 2 <= s2) && (\exists main_~nondetString2~3.offset : int :: (0 <= main_~nondetString2~3.offset && main_~nondetString2~3.offset <= 0) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + main_~nondetString2~3.offset + -1] == 0)) || !(0 == s2)) || unknown-#length-unknown[s1] < 1) || !(1 == \valid[s2])) || !(\exists main_~nondetString2~3.base : int, main_~nondetString2~3.offset : int :: unknown-#memory_int-unknown[main_~nondetString2~3.base][unknown-#length-unknown[main_~nondetString2~3.base] + main_~nondetString2~3.offset + -1] == 0 && !(main_~nondetString2~3.base == s1))) || !(0 == s1)) || !(\exists main_~nondetString2~3.offset : int :: (0 <= main_~nondetString2~3.offset && main_~nondetString2~3.offset <= 0) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + main_~nondetString2~3.offset + -1])) || (((((((1 == \valid[s2] && 1 == \valid[s1]) && 0 == s2) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[s1]) && s1 == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && (\exists main_~nondetString2~3.offset : int :: (0 <= main_~nondetString2~3.offset && main_~nondetString2~3.offset <= 0) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + main_~nondetString2~3.offset + -1] == 0))) || !(\valid[s1] == 1)) || !(0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1])) || !(\exists main_~length2~3 : int, v_main_~nondetString2~3.offset_BEFORE_CALL_2 : int :: ((s2 <= v_main_~nondetString2~3.offset_BEFORE_CALL_2 && 1 <= main_~length2~3) && main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s2]) && unknown-#memory_int-unknown[s2][main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 + -1] == 0)) || (((((((((1 == \valid[s2] && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s1]) && (1 == s1 || s1 + 2 <= unknown-#length-unknown[s1])) && (s2 + 2 <= unknown-#length-unknown[s2] || s2 <= 1)) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 <= s2) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && 1 <= s1) && (\exists main_~nondetString2~3.offset : int :: (0 <= main_~nondetString2~3.offset && main_~nondetString2~3.offset <= 0) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + main_~nondetString2~3.offset + -1] == 0))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 15 error locations. SAFE Result, 29.2s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 9.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 1066 SDslu, 2691 SDs, 0 SdLazy, 2834 SolverSat, 229 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 108 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 821 HoareAnnotationTreeSize, 9 FomulaSimplifications, 633 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1430 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 608 ConstructedInterpolants, 40 QuantifiedInterpolants, 131961 SizeOfPredicates, 52 NumberOfNonLiveVariables, 933 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 27/88 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_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-45-57-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-45-57-649.csv Received shutdown request...