java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:13:00,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:13:00,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:13:00,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:13:00,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:13:00,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:13:00,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:13:00,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:13:00,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:13:00,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:13:00,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:13:00,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:13:00,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:13:00,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:13:00,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:13:00,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:13:00,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:13:00,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:13:00,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:13:00,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:13:00,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:13:00,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:13:00,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:13:00,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:13:00,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:13:00,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:13:00,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:13:00,587 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:13:00,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:13:00,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:13:00,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:13:00,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:13:00,597 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:13:00,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:13:00,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:13:00,598 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:13:00,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:13:00,598 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:13:00,599 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:13:00,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:13:00,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:13:00,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:13:00,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:13:00,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:13:00,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:13:00,600 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:13:00,600 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:13:00,600 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:13:00,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:13:00,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:13:00,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:13:00,601 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:13:00,601 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:13:00,601 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:13:00,601 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:13:00,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:13:00,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:13:00,602 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:13:00,602 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:13:00,602 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:13:00,602 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:13:00,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:13:00,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:13:00,602 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:13:00,603 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:13:00,603 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:13:00,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:13:00,645 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:13:00,649 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:13:00,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:13:00,650 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:13:00,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:13:00,828 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:13:00,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:13:00,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:13:00,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:13:00,838 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:13:00,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:13:00" (1/1) ... [2018-01-28 21:13:00,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c55e0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:00, skipping insertion in model container [2018-01-28 21:13:00,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:13:00" (1/1) ... [2018-01-28 21:13:00,854 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:13:00,891 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:13:01,008 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:13:01,027 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:13:01,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01 WrapperNode [2018-01-28 21:13:01,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:13:01,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:13:01,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:13:01,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:13:01,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... [2018-01-28 21:13:01,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... [2018-01-28 21:13:01,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... [2018-01-28 21:13:01,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... [2018-01-28 21:13:01,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... [2018-01-28 21:13:01,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... [2018-01-28 21:13:01,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... [2018-01-28 21:13:01,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:13:01,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:13:01,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:13:01,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:13:01,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:13:01,127 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:13:01,127 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:13:01,128 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-28 21:13:01,128 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-28 21:13:01,128 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:13:01,129 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:13:01,129 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:13:01,383 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:13:01,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:13:01 BoogieIcfgContainer [2018-01-28 21:13:01,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:13:01,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:13:01,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:13:01,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:13:01,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:13:00" (1/3) ... [2018-01-28 21:13:01,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5556547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:13:01, skipping insertion in model container [2018-01-28 21:13:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:13:01" (2/3) ... [2018-01-28 21:13:01,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5556547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:13:01, skipping insertion in model container [2018-01-28 21:13:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:13:01" (3/3) ... [2018-01-28 21:13:01,390 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:13:01,396 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:13:01,404 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 21:13:01,451 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:13:01,451 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:13:01,451 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:13:01,451 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:13:01,451 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:13:01,452 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:13:01,452 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:13:01,452 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:13:01,453 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:13:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-28 21:13:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:13:01,480 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:01,481 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:01,481 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1879822312, now seen corresponding path program 1 times [2018-01-28 21:13:01,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:01,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:01,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:01,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:01,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:01,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:01,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:01,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:13:01,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:13:01,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:13:01,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:13:01,940 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2018-01-28 21:13:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:02,076 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-28 21:13:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:13:02,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-28 21:13:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:02,088 INFO L225 Difference]: With dead ends: 108 [2018-01-28 21:13:02,088 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 21:13:02,092 INFO L533 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-28 21:13:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 21:13:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-28 21:13:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 21:13:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-28 21:13:02,127 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-01-28 21:13:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:02,128 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-28 21:13:02,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:13:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-28 21:13:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:13:02,129 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:02,129 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:02,129 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:02,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1855050500, now seen corresponding path program 1 times [2018-01-28 21:13:02,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:02,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:02,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:02,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:02,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:02,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:02,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:13:02,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:13:02,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:13:02,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:13:02,192 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 4 states. [2018-01-28 21:13:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:02,246 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-28 21:13:02,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:13:02,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:13:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:02,248 INFO L225 Difference]: With dead ends: 87 [2018-01-28 21:13:02,248 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 21:13:02,249 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:13:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 21:13:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-28 21:13:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 21:13:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-28 21:13:02,259 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 20 [2018-01-28 21:13:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:02,259 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-28 21:13:02,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:13:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-28 21:13:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:13:02,260 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:02,260 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:02,261 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:02,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1855050499, now seen corresponding path program 1 times [2018-01-28 21:13:02,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:02,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:02,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:02,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:02,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:02,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:02,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:13:02,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:13:02,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:13:02,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:13:02,406 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-01-28 21:13:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:02,445 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-28 21:13:02,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:13:02,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 21:13:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:02,447 INFO L225 Difference]: With dead ends: 86 [2018-01-28 21:13:02,447 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:13:02,447 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:13:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:13:02,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 21:13:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:13:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-28 21:13:02,453 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-01-28 21:13:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:02,454 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-28 21:13:02,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:13:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-28 21:13:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:13:02,454 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:02,454 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:02,454 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880838, now seen corresponding path program 1 times [2018-01-28 21:13:02,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:02,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:02,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:02,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:02,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:02,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:02,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:13:02,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:13:02,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:13:02,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:13:02,510 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 5 states. [2018-01-28 21:13:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:02,611 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-01-28 21:13:02,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:13:02,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-28 21:13:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:02,615 INFO L225 Difference]: With dead ends: 91 [2018-01-28 21:13:02,615 INFO L226 Difference]: Without dead ends: 89 [2018-01-28 21:13:02,615 INFO L533 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-28 21:13:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-28 21:13:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-01-28 21:13:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 21:13:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-28 21:13:02,623 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 28 [2018-01-28 21:13:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:02,624 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-28 21:13:02,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:13:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-28 21:13:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:13:02,625 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:02,625 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:02,625 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880837, now seen corresponding path program 1 times [2018-01-28 21:13:02,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:02,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:02,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:02,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:02,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:02,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:02,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:13:02,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:13:02,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:13:02,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:13:02,755 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 8 states. [2018-01-28 21:13:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:02,926 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-28 21:13:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:13:02,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-28 21:13:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:02,928 INFO L225 Difference]: With dead ends: 114 [2018-01-28 21:13:02,928 INFO L226 Difference]: Without dead ends: 112 [2018-01-28 21:13:02,929 INFO L533 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-28 21:13:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-28 21:13:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-01-28 21:13:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-28 21:13:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-01-28 21:13:02,938 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 28 [2018-01-28 21:13:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:02,939 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-01-28 21:13:02,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:13:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-01-28 21:13:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 21:13:02,940 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:02,940 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:02,941 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:02,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1510334872, now seen corresponding path program 1 times [2018-01-28 21:13:02,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:02,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:02,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:02,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:02,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:03,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:03,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:13:03,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:13:03,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:13:03,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:13:03,009 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 6 states. [2018-01-28 21:13:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:03,112 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-01-28 21:13:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:13:03,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-28 21:13:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:03,114 INFO L225 Difference]: With dead ends: 94 [2018-01-28 21:13:03,114 INFO L226 Difference]: Without dead ends: 93 [2018-01-28 21:13:03,115 INFO L533 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-28 21:13:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-28 21:13:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-28 21:13:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-28 21:13:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-01-28 21:13:03,127 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 31 [2018-01-28 21:13:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:03,127 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-01-28 21:13:03,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:13:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-01-28 21:13:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 21:13:03,129 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:03,129 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:03,129 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1510334871, now seen corresponding path program 1 times [2018-01-28 21:13:03,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:03,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:03,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:03,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:03,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:03,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:03,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:03,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:13:03,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:13:03,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:13:03,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:13:03,281 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 9 states. [2018-01-28 21:13:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:03,443 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-01-28 21:13:03,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:13:03,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-28 21:13:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:03,444 INFO L225 Difference]: With dead ends: 98 [2018-01-28 21:13:03,444 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 21:13:03,445 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:13:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 21:13:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-28 21:13:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-28 21:13:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-28 21:13:03,450 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 31 [2018-01-28 21:13:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:03,451 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-28 21:13:03,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:13:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-28 21:13:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:13:03,452 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:03,452 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:03,452 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1711960891, now seen corresponding path program 1 times [2018-01-28 21:13:03,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:03,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:03,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:03,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:03,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:03,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:03,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:03,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:13:03,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:13:03,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:13:03,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:13:03,593 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 6 states. [2018-01-28 21:13:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:03,766 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-28 21:13:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:13:03,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-28 21:13:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:03,767 INFO L225 Difference]: With dead ends: 93 [2018-01-28 21:13:03,768 INFO L226 Difference]: Without dead ends: 72 [2018-01-28 21:13:03,768 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:13:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-28 21:13:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-28 21:13:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 21:13:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-28 21:13:03,775 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 38 [2018-01-28 21:13:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:03,775 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-28 21:13:03,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:13:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-28 21:13:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:13:03,776 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:03,777 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:03,777 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 443587635, now seen corresponding path program 1 times [2018-01-28 21:13:03,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:03,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:03,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:03,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:03,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:03,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:03,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:03,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:13:03,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:13:03,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:13:03,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:13:03,843 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 4 states. [2018-01-28 21:13:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:04,018 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-28 21:13:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:13:04,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-28 21:13:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:04,019 INFO L225 Difference]: With dead ends: 72 [2018-01-28 21:13:04,020 INFO L226 Difference]: Without dead ends: 70 [2018-01-28 21:13:04,020 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:13:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-28 21:13:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-28 21:13:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-28 21:13:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-28 21:13:04,025 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 38 [2018-01-28 21:13:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:04,026 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-28 21:13:04,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:13:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-28 21:13:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:13:04,027 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:04,027 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:04,027 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:04,028 INFO L82 PathProgramCache]: Analyzing trace with hash 443587636, now seen corresponding path program 1 times [2018-01-28 21:13:04,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:04,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:04,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:04,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:04,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:04,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:04,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:13:04,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:13:04,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:13:04,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:13:04,150 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2018-01-28 21:13:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:04,242 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-01-28 21:13:04,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:13:04,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-28 21:13:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:04,243 INFO L225 Difference]: With dead ends: 84 [2018-01-28 21:13:04,243 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:13:04,244 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:13:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:13:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-01-28 21:13:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 21:13:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-28 21:13:04,247 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 38 [2018-01-28 21:13:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:04,248 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-28 21:13:04,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:13:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-28 21:13:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:13:04,248 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:04,248 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:04,249 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1257630254, now seen corresponding path program 1 times [2018-01-28 21:13:04,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:04,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:04,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:04,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:04,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:04,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:04,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:13:04,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:13:04,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:13:04,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:13:04,314 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 7 states. [2018-01-28 21:13:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:04,379 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-28 21:13:04,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:13:04,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-28 21:13:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:04,380 INFO L225 Difference]: With dead ends: 76 [2018-01-28 21:13:04,381 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 21:13:04,381 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:13:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 21:13:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-28 21:13:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 21:13:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-28 21:13:04,385 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 39 [2018-01-28 21:13:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:04,385 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-28 21:13:04,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:13:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-28 21:13:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:13:04,386 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:04,386 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:04,386 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1257630255, now seen corresponding path program 1 times [2018-01-28 21:13:04,387 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:04,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:04,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:04,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:04,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:04,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:13:04,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 21:13:04,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:13:04,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:13:04,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:13:04,562 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 12 states. [2018-01-28 21:13:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:04,828 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-01-28 21:13:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:13:04,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-01-28 21:13:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:04,829 INFO L225 Difference]: With dead ends: 91 [2018-01-28 21:13:04,829 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:13:04,830 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:13:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:13:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2018-01-28 21:13:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 21:13:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-01-28 21:13:04,835 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 39 [2018-01-28 21:13:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:04,835 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-01-28 21:13:04,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:13:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-01-28 21:13:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 21:13:04,837 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:04,838 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:04,838 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash -9982663, now seen corresponding path program 1 times [2018-01-28 21:13:04,838 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:04,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:04,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:04,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:04,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:05,118 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-28 21:13:05,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:13:05,118 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:13:05,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:05,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:13:05,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:13:05,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:13:05,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:13:05,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:13:05,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:13:05,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 21:13:05,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-28 21:13:05,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-28 21:13:05,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:13:05,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 21:13:05,363 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 25 treesize of output 26 [2018-01-28 21:13:05,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-28 21:13:05,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-28 21:13:05,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-28 21:13:05,694 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 30 treesize of output 28 [2018-01-28 21:13:05,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-28 21:13:05,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:13:05,717 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 8 treesize of output 1 [2018-01-28 21:13:05,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:05,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:13:05,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:13:05,742 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-28 21:13:05,815 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-28 21:13:05,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:13:05,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-01-28 21:13:05,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 21:13:05,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 21:13:05,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:13:05,840 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 25 states. [2018-01-28 21:13:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:06,840 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-01-28 21:13:06,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:13:06,841 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-01-28 21:13:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:06,841 INFO L225 Difference]: With dead ends: 100 [2018-01-28 21:13:06,841 INFO L226 Difference]: Without dead ends: 98 [2018-01-28 21:13:06,842 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 21:13:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-28 21:13:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-01-28 21:13:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:13:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-28 21:13:06,848 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 47 [2018-01-28 21:13:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:06,848 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-28 21:13:06,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 21:13:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-28 21:13:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:13:06,850 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:06,850 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:06,850 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1040766997, now seen corresponding path program 1 times [2018-01-28 21:13:06,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:06,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:06,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:06,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:06,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:06,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:07,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:13:07,215 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:13:07,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:07,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:13:07,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-28 21:13:07,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-28 21:13:07,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:07,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:07,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:13:07,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:13:07,614 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-28 21:13:07,617 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 27 treesize of output 20 [2018-01-28 21:13:07,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:07,631 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 20 treesize of output 18 [2018-01-28 21:13:07,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:13:07,652 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-28 21:13:07,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 21:13:07,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:13:07,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:13:07,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-28 21:13:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:07,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:13:07,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2018-01-28 21:13:07,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 21:13:07,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 21:13:07,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-01-28 21:13:07,747 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 27 states. [2018-01-28 21:13:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:09,675 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-01-28 21:13:09,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:13:09,675 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-01-28 21:13:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:09,676 INFO L225 Difference]: With dead ends: 91 [2018-01-28 21:13:09,676 INFO L226 Difference]: Without dead ends: 90 [2018-01-28 21:13:09,676 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1662, Unknown=0, NotChecked=0, Total=1892 [2018-01-28 21:13:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-28 21:13:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-01-28 21:13:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:13:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-01-28 21:13:09,682 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 50 [2018-01-28 21:13:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:09,682 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-01-28 21:13:09,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 21:13:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-01-28 21:13:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 21:13:09,683 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:09,683 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:09,683 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1564459918, now seen corresponding path program 1 times [2018-01-28 21:13:09,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:09,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:09,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:09,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:09,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:09,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:09,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:13:09,806 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:13:09,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:09,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:13:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:09,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:13:09,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-01-28 21:13:09,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:13:09,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:13:09,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:13:09,899 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 12 states. [2018-01-28 21:13:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:10,013 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-01-28 21:13:10,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:13:10,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-01-28 21:13:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:10,014 INFO L225 Difference]: With dead ends: 88 [2018-01-28 21:13:10,014 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 21:13:10,014 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:13:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 21:13:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-01-28 21:13:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 21:13:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-01-28 21:13:10,019 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 57 [2018-01-28 21:13:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:10,020 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-01-28 21:13:10,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:13:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-01-28 21:13:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 21:13:10,021 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:10,021 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:10,021 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:10,021 INFO L82 PathProgramCache]: Analyzing trace with hash -862301775, now seen corresponding path program 1 times [2018-01-28 21:13:10,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:10,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:10,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:10,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:10,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:10,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:10,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:13:10,188 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:13:10,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:10,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:13:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:10,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:13:10,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 15 [2018-01-28 21:13:10,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 21:13:10,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 21:13:10,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:13:10,323 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 16 states. [2018-01-28 21:13:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:10,531 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-01-28 21:13:10,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:13:10,532 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-01-28 21:13:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:10,533 INFO L225 Difference]: With dead ends: 81 [2018-01-28 21:13:10,533 INFO L226 Difference]: Without dead ends: 73 [2018-01-28 21:13:10,533 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:13:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-28 21:13:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-28 21:13:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-28 21:13:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-01-28 21:13:10,539 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 58 [2018-01-28 21:13:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:10,540 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-01-28 21:13:10,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 21:13:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-01-28 21:13:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 21:13:10,541 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:10,541 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:10,541 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:10,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1886745275, now seen corresponding path program 2 times [2018-01-28 21:13:10,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:10,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:10,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:10,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:13:10,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:10,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:11,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:13:11,290 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:13:11,296 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:13:11,312 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:13:11,324 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:13:11,329 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:13:11,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:13:11,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:13:11,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:13:11,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:13:11,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:13:11,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-28 21:13:11,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:13:11,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:13:11,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:13:11,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-28 21:13:11,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-28 21:13:11,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-28 21:13:11,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:13:11,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-28 21:13:11,481 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 29 treesize of output 30 [2018-01-28 21:13:11,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-28 21:13:11,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:11,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 21:13:11,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-28 21:13:11,983 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 34 treesize of output 32 [2018-01-28 21:13:11,986 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-28 21:13:12,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:12,027 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 18 treesize of output 15 [2018-01-28 21:13:12,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:13:12,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:13:12,039 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-28 21:13:12,039 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-28 21:13:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:12,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:13:12,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2018-01-28 21:13:12,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 21:13:12,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 21:13:12,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:13:12,163 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 33 states. [2018-01-28 21:13:15,987 WARN L146 SmtUtils]: Spent 3330ms on a formula simplification. DAG size of input: 74 DAG size of output 49 [2018-01-28 21:13:18,333 WARN L146 SmtUtils]: Spent 2182ms on a formula simplification. DAG size of input: 86 DAG size of output 57 [2018-01-28 21:13:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:19,343 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-01-28 21:13:19,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:13:19,343 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-01-28 21:13:19,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:19,344 INFO L225 Difference]: With dead ends: 79 [2018-01-28 21:13:19,344 INFO L226 Difference]: Without dead ends: 78 [2018-01-28 21:13:19,345 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=311, Invalid=2239, Unknown=0, NotChecked=0, Total=2550 [2018-01-28 21:13:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-28 21:13:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2018-01-28 21:13:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 21:13:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-01-28 21:13:19,350 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 66 [2018-01-28 21:13:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:19,350 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-01-28 21:13:19,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 21:13:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-01-28 21:13:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:13:19,351 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:13:19,351 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:13:19,351 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-28 21:13:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash -208512215, now seen corresponding path program 2 times [2018-01-28 21:13:19,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:13:19,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:13:19,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:19,352 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:13:19,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:13:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:13:19,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:13:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:19,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:13:19,812 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-28 21:13:19,818 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:13:19,830 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:13:19,841 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:13:19,844 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:13:19,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:13:19,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:13:19,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:19,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:19,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:13:19,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 21:13:19,861 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-28 21:13:19,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:19,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:19,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:13:19,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-28 21:13:20,167 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 32 treesize of output 32 [2018-01-28 21:13:20,169 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 28 treesize of output 21 [2018-01-28 21:13:20,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:13:20,183 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 21 treesize of output 19 [2018-01-28 21:13:20,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:13:20,205 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 24 treesize of output 27 [2018-01-28 21:13:20,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 21:13:20,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:13:20,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:13:20,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-28 21:13:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:13:20,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:13:20,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-01-28 21:13:20,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 21:13:20,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 21:13:20,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:13:20,306 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 32 states. [2018-01-28 21:13:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:13:21,610 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-28 21:13:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 21:13:21,610 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-01-28 21:13:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:13:21,610 INFO L225 Difference]: With dead ends: 75 [2018-01-28 21:13:21,610 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:13:21,611 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=411, Invalid=2781, Unknown=0, NotChecked=0, Total=3192 [2018-01-28 21:13:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:13:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:13:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:13:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:13:21,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-01-28 21:13:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:13:21,612 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:13:21,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 21:13:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:13:21,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:13:21,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:13:22,236 WARN L146 SmtUtils]: Spent 557ms on a formula simplification. DAG size of input: 90 DAG size of output 62 [2018-01-28 21:13:37,025 WARN L146 SmtUtils]: Spent 14785ms on a formula simplification. DAG size of input: 163 DAG size of output 125 [2018-01-28 21:13:37,038 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,038 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 567) the Hoare annotation is: true [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 567) the Hoare annotation is: true [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-28 21:13:37,039 INFO L399 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L395 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString2~4.base)) (.cse1 (select |#length| main_~nondetString1~4.base))) (and (= (select (select |#memory_int| main_~nondetString2~4.base) (+ .cse0 (- 1))) 0) (= 1 (select |#valid| |main_#t~malloc12.base|)) (not (= main_~nondetString2~4.base main_~nondetString1~4.base)) (= 0 |main_#t~malloc11.offset|) (not (= |main_#t~malloc12.base| main_~nondetString1~4.base)) (<= 1 main_~length2~4) (= (store (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0) |old(#valid)|) (= main_~nondetString2~4.offset 0) (= main_~length1~4 (select |#length| |main_#t~malloc11.base|)) (= main_~length2~4 .cse0) (<= (+ main_~nondetString1~4.offset 1) .cse1) (= main_~nondetString1~4.offset 0) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc12.offset|) (= 1 (select |#valid| main_~nondetString2~4.base)) (= main_~length2~4 (select |#length| |main_#t~malloc12.base|)) (= .cse1 main_~length1~4) (not (= |main_#t~malloc11.base| |main_#t~malloc12.base|)) (exists ((main_~nondetString1~4.offset Int)) (and (<= main_~nondetString1~4.offset 0) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset (select |#length| main_~nondetString1~4.base) (- 1))) 0) (<= 0 main_~nondetString1~4.offset))) (= 1 (select |#valid| main_~nondetString1~4.base)))) [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L566''''(line 566) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L566'''(line 566) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-28 21:13:37,040 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 553 567) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 553 567) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 553 567) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 553 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L563'''(line 563) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L566''(line 566) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point L546''''''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,041 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 552) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L546'''''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L548'''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,042 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L546'''''''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr9RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr6RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L547''''''(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L546''''''''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L546''''''''''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr5RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr7RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L545''''(lines 545 550) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point L548''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,043 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr4RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr8RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point cstrncmpEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L395 ceAbstractionStarter]: At program point L545'''(lines 545 550) the Hoare annotation is: (let ((.cse4 (select |#length| cstrncmp_~s1.base)) (.cse8 (select |#length| cstrncmp_~s2.base))) (let ((.cse6 (select |#length| |cstrncmp_#in~s2.base|)) (.cse0 (exists ((main_~nondetString1~4.offset Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ main_~nondetString1~4.offset (select |#length| cstrncmp_~s1.base) (- 1)))) (<= main_~nondetString1~4.offset 0) (<= 0 main_~nondetString1~4.offset)))) (.cse1 (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= (select (select |#memory_int| main_~nondetString2~4.base) (+ (select |#length| main_~nondetString2~4.base) main_~nondetString2~4.offset (- 1))) 0) (not (= main_~nondetString2~4.base cstrncmp_~s1.base))))) (.cse7 (<= (+ cstrncmp_~s2.offset 1) .cse8)) (.cse2 (= 1 (select |#valid| cstrncmp_~s1.base))) (.cse3 (= (select (select |#memory_int| cstrncmp_~s2.base) (+ .cse8 (- 1))) 0)) (.cse5 (= 1 (select |#valid| cstrncmp_~s2.base))) (.cse9 (<= (+ cstrncmp_~s1.offset 1) .cse4))) (or (not (= 1 (select |#valid| |cstrncmp_#in~s2.base|))) (and .cse0 .cse1 .cse2 (= 0 cstrncmp_~s2.offset) .cse3 (<= 1 .cse4) (exists ((main_~length2~4 Int) (v_main_~nondetString2~4.offset_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| cstrncmp_~s2.base) (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_1) (select |#length| cstrncmp_~s2.base)) (<= cstrncmp_~s2.offset v_main_~nondetString2~4.offset_BEFORE_CALL_1) (<= 1 main_~length2~4))) (= 0 cstrncmp_~s1.offset) .cse5) (< .cse6 1) (not (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~4.base) (+ main_~nondetString2~4.offset (select |#length| main_~nondetString2~4.base) (- 1)))) (not (= main_~nondetString2~4.base |cstrncmp_#in~s1.base|))))) (not (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ .cse6 (- 1))))) (and (<= 1 cstrncmp_~s1.offset) .cse0 .cse1 .cse7 .cse2 (<= 1 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s1.offset 2) .cse4) (= 1 cstrncmp_~s1.offset)) (or (<= (+ cstrncmp_~s2.offset 2) .cse8) (<= cstrncmp_~s2.offset 1)) .cse3 .cse5 .cse9) (not (= (select |#valid| |cstrncmp_#in~s1.base|) 1)) (not (= 0 |cstrncmp_#in~s1.offset|)) (not (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| |cstrncmp_#in~s1.base|)) (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4) (<= |cstrncmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_1)))) (and (<= 2 cstrncmp_~s2.offset) .cse0 .cse1 (<= 2 cstrncmp_~s1.offset) .cse7 .cse2 .cse3 .cse5 .cse9) (not (exists ((main_~nondetString1~4.offset Int)) (and (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~nondetString1~4.offset (select |#length| |cstrncmp_#in~s1.base|) (- 1))) 0) (<= main_~nondetString1~4.offset 0) (<= 0 main_~nondetString1~4.offset)))) (not (= 0 |cstrncmp_#in~s2.offset|))))) [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point L547'''''''(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 552) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L402 ceAbstractionStarter]: At program point cstrncmpENTRY(lines 540 552) the Hoare annotation is: true [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point L546'''''''''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,044 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-28 21:13:37,045 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,045 INFO L399 ceAbstractionStarter]: For program point L545'(lines 545 550) no Hoare annotation was computed. [2018-01-28 21:13:37,045 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-28 21:13:37,045 INFO L399 ceAbstractionStarter]: For program point cstrncmpFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-28 21:13:37,045 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-28 21:13:37,045 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-28 21:13:37,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,055 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,055 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,055 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,055 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,055 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,056 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,056 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,056 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,056 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,056 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,083 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,083 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,083 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,083 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,084 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,084 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,087 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,087 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,087 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,097 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,097 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,097 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,097 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:13:37 BoogieIcfgContainer [2018-01-28 21:13:37,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:13:37,105 INFO L168 Benchmark]: Toolchain (without parser) took 36276.24 ms. Allocated memory was 300.4 MB in the beginning and 607.6 MB in the end (delta: 307.2 MB). Free memory was 260.4 MB in the beginning and 535.4 MB in the end (delta: -274.9 MB). Peak memory consumption was 260.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:13:37,106 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:13:37,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.11 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 249.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-28 21:13:37,107 INFO L168 Benchmark]: Boogie Preprocessor took 39.12 ms. Allocated memory is still 300.4 MB. Free memory was 249.2 MB in the beginning and 247.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:13:37,107 INFO L168 Benchmark]: RCFGBuilder took 308.11 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 224.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:13:37,107 INFO L168 Benchmark]: TraceAbstraction took 35719.44 ms. Allocated memory was 300.4 MB in the beginning and 607.6 MB in the end (delta: 307.2 MB). Free memory was 224.6 MB in the beginning and 535.4 MB in the end (delta: -310.8 MB). Peak memory consumption was 225.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:13:37,109 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.11 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 249.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.12 ms. Allocated memory is still 300.4 MB. Free memory was 249.2 MB in the beginning and 247.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 308.11 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 224.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 35719.44 ms. Allocated memory was 300.4 MB in the beginning and 607.6 MB in the end (delta: 307.2 MB). Free memory was 224.6 MB in the beginning and 535.4 MB in the end (delta: -310.8 MB). Peak memory consumption was 225.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 * 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: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-28 21:13:37,119 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,120 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,120 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,120 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,120 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,121 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,121 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,121 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,121 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,124 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,124 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,124 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,124 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,129 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,129 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,140 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,140 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,140 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,141 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,141 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,141 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,141 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,142 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,142 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,142 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,142 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,143 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,143 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-28 21:13:37,143 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,143 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,144 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-28 21:13:37,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:13:37,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-28 21:13:37,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-28 21:13:37,149 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,149 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,149 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-28 21:13:37,149 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,149 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,150 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,150 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,150 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,150 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:13:37,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:13:37,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(1 == \valid[s2]) || (((((((((\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset) && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && 1 == \valid[s1]) && 0 == s2) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 <= unknown-#length-unknown[s1]) && (\exists main_~length2~4 : int, v_main_~nondetString2~4.offset_BEFORE_CALL_1 : int :: ((unknown-#memory_int-unknown[s2][main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_1 + -1] == 0 && main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s2]) && s2 <= v_main_~nondetString2~4.offset_BEFORE_CALL_1) && 1 <= main_~length2~4)) && 0 == s1) && 1 == \valid[s2])) || unknown-#length-unknown[s2] < 1) || !(\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~4.base][main_~nondetString2~4.offset + unknown-#length-unknown[main_~nondetString2~4.base] + -1] && !(main_~nondetString2~4.base == s1))) || !(0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1])) || ((((((((((1 <= s1 && (\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && 1 <= s2) && (s1 + 2 <= unknown-#length-unknown[s1] || 1 == s1)) && (s2 + 2 <= unknown-#length-unknown[s2] || s2 <= 1)) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 == \valid[s2]) && s1 + 1 <= unknown-#length-unknown[s1])) || !(\valid[s1] == 1)) || !(0 == s1)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s1] && unknown-#memory_int-unknown[s1][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length1~4) && s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_1)) || ((((((((2 <= s2 && (\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 == \valid[s2]) && s1 + 1 <= unknown-#length-unknown[s1])) || !(\exists main_~nondetString1~4.offset : int :: (unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] == 0 && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) || !(0 == s2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 15 error locations. SAFE Result, 35.6s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 15.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1139 SDtfs, 1937 SDslu, 6238 SDs, 0 SdLazy, 3275 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 310 SyntacticMatches, 5 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 67 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 9 NumberOfFragments, 507 HoareAnnotationTreeSize, 7 FomulaSimplifications, 110 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 883 FormulaSimplificationTreeSizeReductionInter, 15.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1039 ConstructedInterpolants, 75 QuantifiedInterpolants, 551503 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1079 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 42/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-13-37-163.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-13-37-163.csv Received shutdown request...