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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:20:37,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:20:37,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:20:37,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:20:37,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:20:37,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:20:37,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:20:37,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:20:37,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:20:37,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:20:37,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:20:37,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:20:37,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:20:37,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:20:37,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:20:37,683 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:20:37,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:20:37,687 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:20:37,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:20:37,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:20:37,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:20:37,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:20:37,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:20:37,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:20:37,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:20:37,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:20:37,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:20:37,694 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:20:37,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:20:37,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:20:37,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:20:37,695 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:20:37,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:20:37,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:20:37,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:20:37,706 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:20:37,706 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:20:37,706 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:20:37,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:20:37,706 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:20:37,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:20:37,707 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:20:37,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:20:37,707 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:20:37,707 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:20:37,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:20:37,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:20:37,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:20:37,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:20:37,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:20:37,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:20:37,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:20:37,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:20:37,708 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:20:37,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:20:37,709 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:20:37,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:20:37,747 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:20:37,750 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:20:37,752 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:20:37,752 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:20:37,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:20:37,879 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:20:37,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:20:37,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:20:37,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:20:37,886 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:20:37,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:20:37" (1/1) ... [2018-02-04 17:20:37,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e12e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:37, skipping insertion in model container [2018-02-04 17:20:37,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:20:37" (1/1) ... [2018-02-04 17:20:37,905 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:20:37,933 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:20:38,013 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:20:38,023 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:20:38,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38 WrapperNode [2018-02-04 17:20:38,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:20:38,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:20:38,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:20:38,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:20:38,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... [2018-02-04 17:20:38,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... [2018-02-04 17:20:38,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... [2018-02-04 17:20:38,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... [2018-02-04 17:20:38,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... [2018-02-04 17:20:38,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... [2018-02-04 17:20:38,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... [2018-02-04 17:20:38,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:20:38,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:20:38,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:20:38,057 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:20:38,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 17:20:38,094 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:20:38,094 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:20:38,094 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 17:20:38,094 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:20:38,094 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:20:38,094 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:20:38,094 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:20:38,094 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:20:38,094 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:20:38,095 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:20:38,095 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 17:20:38,095 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:20:38,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:20:38,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:20:38,218 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:20:38,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:20:38 BoogieIcfgContainer [2018-02-04 17:20:38,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:20:38,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:20:38,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:20:38,222 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:20:38,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:20:37" (1/3) ... [2018-02-04 17:20:38,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e75c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:20:38, skipping insertion in model container [2018-02-04 17:20:38,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:38" (2/3) ... [2018-02-04 17:20:38,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e75c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:20:38, skipping insertion in model container [2018-02-04 17:20:38,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:20:38" (3/3) ... [2018-02-04 17:20:38,226 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:20:38,234 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:20:38,241 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 17:20:38,274 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:20:38,275 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:20:38,275 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:20:38,275 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:20:38,275 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:20:38,275 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:20:38,275 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:20:38,275 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:20:38,276 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:20:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 17:20:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:20:38,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:38,297 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:38,298 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-02-04 17:20:38,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:38,304 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:38,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,334 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:38,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:38,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:38,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:38,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:20:38,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:20:38,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:20:38,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:20:38,448 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-02-04 17:20:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:38,501 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 17:20:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:20:38,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:20:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:38,507 INFO L225 Difference]: With dead ends: 29 [2018-02-04 17:20:38,507 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 17:20:38,509 INFO L554 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-02-04 17:20:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 17:20:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 17:20:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 17:20:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 17:20:38,588 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-04 17:20:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:38,588 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 17:20:38,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:20:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 17:20:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:20:38,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:38,589 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:38,590 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-02-04 17:20:38,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:38,590 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:38,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:38,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:38,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:38,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:38,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:20:38,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:20:38,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:20:38,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:20:38,674 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-04 17:20:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:38,712 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-04 17:20:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:20:38,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 17:20:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:38,713 INFO L225 Difference]: With dead ends: 25 [2018-02-04 17:20:38,713 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 17:20:38,714 INFO L554 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-02-04 17:20:38,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 17:20:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 17:20:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 17:20:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 17:20:38,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-02-04 17:20:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:38,717 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 17:20:38,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:20:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 17:20:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:20:38,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:38,717 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:38,717 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-02-04 17:20:38,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:38,718 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:38,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:38,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:38,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:38,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:38,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:20:38,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:20:38,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:20:38,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:20:38,765 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-02-04 17:20:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:38,791 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-02-04 17:20:38,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:20:38,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:20:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:38,792 INFO L225 Difference]: With dead ends: 24 [2018-02-04 17:20:38,792 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 17:20:38,792 INFO L554 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-02-04 17:20:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 17:20:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 17:20:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 17:20:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-04 17:20:38,794 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-02-04 17:20:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:38,794 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-04 17:20:38,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:20:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-04 17:20:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:20:38,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:38,795 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:38,795 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-02-04 17:20:38,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:38,795 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:38,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,796 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:38,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:38,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:38,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:38,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:20:38,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:20:38,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:20:38,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:20:38,873 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-02-04 17:20:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:38,945 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-02-04 17:20:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:20:38,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-04 17:20:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:38,947 INFO L225 Difference]: With dead ends: 30 [2018-02-04 17:20:38,947 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 17:20:38,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:20:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 17:20:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-02-04 17:20:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 17:20:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 17:20:38,950 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-02-04 17:20:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:38,950 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 17:20:38,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:20:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 17:20:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:20:38,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:38,951 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:38,951 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-02-04 17:20:38,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:38,952 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:38,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:38,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:38,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:39,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:39,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:20:39,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:20:39,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:20:39,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:20:39,054 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-02-04 17:20:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:39,138 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-04 17:20:39,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:20:39,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 17:20:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:39,139 INFO L225 Difference]: With dead ends: 42 [2018-02-04 17:20:39,139 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 17:20:39,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:20:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 17:20:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-04 17:20:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:20:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-04 17:20:39,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-02-04 17:20:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:39,144 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-04 17:20:39,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:20:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-04 17:20:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:20:39,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:39,145 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:39,145 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:39,145 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-02-04 17:20:39,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:39,145 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:39,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:39,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:39,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:39,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:39,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:39,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:39,268 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:39,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:39,331 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-02-04 17:20:39,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:39,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:39,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:20:39,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:20:39,364 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-02-04 17:20:39,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:39,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:39,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:39,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:20:39,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 17:20:39,442 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-02-04 17:20:39,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:39,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:39,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:39,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:20:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:39,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:20:39,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-02-04 17:20:39,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:20:39,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:20:39,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:20:39,526 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-02-04 17:20:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:39,806 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-04 17:20:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:20:39,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-02-04 17:20:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:39,807 INFO L225 Difference]: With dead ends: 47 [2018-02-04 17:20:39,807 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 17:20:39,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:20:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 17:20:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-02-04 17:20:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:20:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-02-04 17:20:39,811 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-02-04 17:20:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:39,811 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-02-04 17:20:39,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:20:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-02-04 17:20:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:20:39,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:39,812 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:39,812 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:39,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-02-04 17:20:39,813 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:39,813 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:39,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:39,813 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:39,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:39,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:39,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:39,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:39,987 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:20:40,010 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:20:40,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:40,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:40,017 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-02-04 17:20:40,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:20:40,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:20:40,028 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-02-04 17:20:40,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:20:40,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 17:20:40,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:20:40,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:40,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:40,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:40,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:40 [2018-02-04 17:20:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:40,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:20:40,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-02-04 17:20:40,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:20:40,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:20:40,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:20:40,141 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-02-04 17:20:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:40,393 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-02-04 17:20:40,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:20:40,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-02-04 17:20:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:40,399 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:20:40,399 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 17:20:40,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:20:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 17:20:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-02-04 17:20:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 17:20:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-04 17:20:40,401 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-02-04 17:20:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:40,402 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-04 17:20:40,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:20:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-04 17:20:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:20:40,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:40,402 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:40,402 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-02-04 17:20:40,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:40,403 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:40,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:40,403 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:40,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:40,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:40,416 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:40,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:40,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:40,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:40,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:40,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:40,447 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 5 [2018-02-04 17:20:40,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:20:40,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:20:40,463 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |main_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc3.base| 0)))) is different from true [2018-02-04 17:20:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:40,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:40,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:20:40,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:20:40,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:20:40,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:20:40,466 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-02-04 17:20:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:40,494 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-04 17:20:40,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:20:40,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 17:20:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:40,494 INFO L225 Difference]: With dead ends: 42 [2018-02-04 17:20:40,495 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 17:20:40,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:20:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 17:20:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 17:20:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 17:20:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-02-04 17:20:40,496 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-02-04 17:20:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:40,496 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-02-04 17:20:40,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:20:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-02-04 17:20:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:20:40,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:40,497 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:40,497 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1680759059, now seen corresponding path program 3 times [2018-02-04 17:20:40,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:40,497 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:40,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:40,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:40,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:40,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:20:40,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:40,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:40,605 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:20:40,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:20:40,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:40,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:40,638 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-02-04 17:20:40,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:20:40,646 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-02-04 17:20:40,648 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-02-04 17:20:40,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:20:40,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 17:20:40,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:20:40,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:40,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:40,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:40,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:20:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:20:40,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:20:40,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-02-04 17:20:40,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:20:40,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:20:40,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:20:40,715 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-02-04 17:20:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:40,829 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-02-04 17:20:40,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:20:40,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-04 17:20:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:40,830 INFO L225 Difference]: With dead ends: 23 [2018-02-04 17:20:40,830 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:20:40,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:20:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:20:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:20:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:20:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:20:40,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-02-04 17:20:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:40,831 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:20:40,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:20:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:20:40,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:20:40,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:20:40 BoogieIcfgContainer [2018-02-04 17:20:40,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:20:40,836 INFO L168 Benchmark]: Toolchain (without parser) took 2956.71 ms. Allocated memory was 403.2 MB in the beginning and 686.3 MB in the end (delta: 283.1 MB). Free memory was 359.6 MB in the beginning and 555.0 MB in the end (delta: -195.4 MB). Peak memory consumption was 87.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:40,837 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 403.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:20:40,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.83 ms. Allocated memory is still 403.2 MB. Free memory was 359.6 MB in the beginning and 349.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:40,837 INFO L168 Benchmark]: Boogie Preprocessor took 28.17 ms. Allocated memory is still 403.2 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:40,837 INFO L168 Benchmark]: RCFGBuilder took 161.85 ms. Allocated memory is still 403.2 MB. Free memory was 346.4 MB in the beginning and 331.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:40,838 INFO L168 Benchmark]: TraceAbstraction took 2615.81 ms. Allocated memory was 403.2 MB in the beginning and 686.3 MB in the end (delta: 283.1 MB). Free memory was 331.9 MB in the beginning and 555.0 MB in the end (delta: -223.1 MB). Peak memory consumption was 60.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:40,839 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.18 ms. Allocated memory is still 403.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.83 ms. Allocated memory is still 403.2 MB. Free memory was 359.6 MB in the beginning and 349.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.17 ms. Allocated memory is still 403.2 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 161.85 ms. Allocated memory is still 403.2 MB. Free memory was 346.4 MB in the beginning and 331.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2615.81 ms. Allocated memory was 403.2 MB in the beginning and 686.3 MB in the end (delta: 283.1 MB). Free memory was 331.9 MB in the beginning and 555.0 MB in the end (delta: -223.1 MB). Peak memory consumption was 60.0 MB. Max. memory is 5.3 GB. * 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: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 2.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 275 SDslu, 646 SDs, 0 SdLazy, 627 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 58 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 195 ConstructedInterpolants, 12 QuantifiedInterpolants, 28203 SizeOfPredicates, 24 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-20-40-845.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-20-40-845.csv Received shutdown request...