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/cstrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:19:56,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:19:56,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:19:56,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:19:56,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:19:56,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:19:56,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:19:56,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:19:56,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:19:56,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:19:56,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:19:56,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:19:56,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:19:56,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:19:56,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:19:56,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:19:56,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:19:56,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:19:56,697 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:19:56,698 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:19:56,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:19:56,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:19:56,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:19:56,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:19:56,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:19:56,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:19:56,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:19:56,703 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:19:56,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:19:56,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:19:56,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:19:56,704 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:19:56,713 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:19:56,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:19:56,715 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:19:56,715 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:19:56,715 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:19:56,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:19:56,715 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:19:56,716 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:19:56,716 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:19:56,716 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:19:56,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:19:56,716 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:19:56,716 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:19:56,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:19:56,717 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:19:56,717 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:19:56,717 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:19:56,717 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:19:56,717 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:19:56,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:19:56,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:19:56,718 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:19:56,718 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:19:56,718 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:19:56,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:19:56,757 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:19:56,760 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:19:56,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:19:56,762 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:19:56,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:19:56,894 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:19:56,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:19:56,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:19:56,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:19:56,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:19:56,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:19:56" (1/1) ... [2018-02-04 17:19:56,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d8ab84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:56, skipping insertion in model container [2018-02-04 17:19:56,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:19:56" (1/1) ... [2018-02-04 17:19:56,917 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:19:56,945 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:19:57,031 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:19:57,043 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:19:57,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57 WrapperNode [2018-02-04 17:19:57,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:19:57,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:19:57,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:19:57,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:19:57,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (1/1) ... [2018-02-04 17:19:57,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (1/1) ... [2018-02-04 17:19:57,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (1/1) ... [2018-02-04 17:19:57,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (1/1) ... [2018-02-04 17:19:57,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (1/1) ... [2018-02-04 17:19:57,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (1/1) ... [2018-02-04 17:19:57,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (1/1) ... [2018-02-04 17:19:57,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:19:57,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:19:57,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:19:57,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:19:57,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (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:19:57,110 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:19:57,110 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:19:57,110 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-02-04 17:19:57,110 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:19:57,110 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:19:57,111 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:19:57,111 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:19:57,111 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:19:57,111 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:19:57,111 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:19:57,111 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-02-04 17:19:57,111 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:19:57,112 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:19:57,112 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:19:57,378 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:19:57,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:19:57 BoogieIcfgContainer [2018-02-04 17:19:57,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:19:57,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:19:57,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:19:57,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:19:57,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:19:56" (1/3) ... [2018-02-04 17:19:57,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1672a347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:19:57, skipping insertion in model container [2018-02-04 17:19:57,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:19:57" (2/3) ... [2018-02-04 17:19:57,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1672a347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:19:57, skipping insertion in model container [2018-02-04 17:19:57,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:19:57" (3/3) ... [2018-02-04 17:19:57,383 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:19:57,388 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:19:57,392 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 17:19:57,421 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:19:57,421 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:19:57,421 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:19:57,422 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:19:57,422 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:19:57,422 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:19:57,422 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:19:57,422 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:19:57,423 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:19:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-02-04 17:19:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:19:57,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:57,441 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:19:57,441 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-02-04 17:19:57,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:57,446 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:57,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:57,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:57,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:57,587 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:19:57,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:19:57,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:19:57,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:19:57,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:19:57,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:19:57,601 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-02-04 17:19:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:19:57,661 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 17:19:57,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:19:57,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:19:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:19:57,708 INFO L225 Difference]: With dead ends: 40 [2018-02-04 17:19:57,708 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 17:19:57,709 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:19:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 17:19:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 17:19:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:19:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-04 17:19:57,730 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-02-04 17:19:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:19:57,730 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-04 17:19:57,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:19:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-04 17:19:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:19:57,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:57,731 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:19:57,731 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-02-04 17:19:57,732 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:57,732 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:57,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:57,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:57,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:57,826 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:19:57,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:19:57,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:19:57,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:19:57,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:19:57,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:19:57,828 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-02-04 17:19:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:19:57,865 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-02-04 17:19:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:19:57,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 17:19:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:19:57,866 INFO L225 Difference]: With dead ends: 36 [2018-02-04 17:19:57,867 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:19:57,867 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:19:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:19:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:19:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:19:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-04 17:19:57,871 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-02-04 17:19:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:19:57,871 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-04 17:19:57,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:19:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-04 17:19:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:19:57,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:57,872 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:19:57,872 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-02-04 17:19:57,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:57,873 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:57,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,874 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:57,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:57,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:57,916 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:19:57,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:19:57,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:19:57,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:19:57,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:19:57,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:19:57,917 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-02-04 17:19:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:19:57,960 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 17:19:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:19:57,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:19:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:19:57,961 INFO L225 Difference]: With dead ends: 33 [2018-02-04 17:19:57,961 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 17:19:57,962 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:19:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 17:19:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-04 17:19:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 17:19:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-02-04 17:19:57,965 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-02-04 17:19:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:19:57,965 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-02-04 17:19:57,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:19:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-02-04 17:19:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:19:57,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:57,966 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:19:57,966 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-02-04 17:19:57,966 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:57,966 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:57,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,967 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:57,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:57,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:58,049 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:19:58,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:19:58,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:19:58,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:19:58,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:19:58,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:19:58,051 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-02-04 17:19:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:19:58,125 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-02-04 17:19:58,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:19:58,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 17:19:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:19:58,129 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:19:58,130 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:19:58,130 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:19:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:19:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-02-04 17:19:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:19:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-02-04 17:19:58,134 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-02-04 17:19:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:19:58,134 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-02-04 17:19:58,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:19:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-02-04 17:19:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:19:58,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:58,135 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:19:58,135 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-02-04 17:19:58,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:58,135 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:58,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:58,136 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:58,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:58,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:58,161 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:19:58,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:19:58,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:19:58,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:19:58,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:19:58,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:19:58,162 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-02-04 17:19:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:19:58,172 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-04 17:19:58,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:19:58,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-04 17:19:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:19:58,174 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:19:58,174 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:19:58,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:19:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:19:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 17:19:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 17:19:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 17:19:58,180 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-02-04 17:19:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:19:58,180 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 17:19:58,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:19:58,180 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 17:19:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:19:58,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:58,181 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:19:58,181 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:58,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-02-04 17:19:58,182 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:58,182 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:58,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:58,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:58,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:58,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:58,371 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:19:58,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:19:58,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:19:58,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:58,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:19:58,452 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:19:58,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:19:58,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:19:58,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:19:58,521 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:19:58,522 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:19:58,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:19:58,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:19:58,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:19:58,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:23 [2018-02-04 17:19:58,604 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:19:58,610 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:19:58,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:19:58,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:19:58,626 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:19:58,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:19:58,727 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:19:58,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:19:58,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 17:19:58,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:19:58,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:19:58,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:19:58,729 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 20 states. [2018-02-04 17:19:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:19:59,118 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-02-04 17:19:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:19:59,119 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2018-02-04 17:19:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:19:59,119 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:19:59,119 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:19:59,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:19:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:19:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-02-04 17:19:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:19:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-04 17:19:59,122 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-02-04 17:19:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:19:59,122 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-04 17:19:59,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:19:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-04 17:19:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:19:59,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:59,123 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, 1, 1, 1, 1, 1] [2018-02-04 17:19:59,124 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-02-04 17:19:59,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:59,124 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:59,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:59,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:59,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:59,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:59,145 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:19:59,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:19:59,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:19:59,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:59,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:19:59,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:19:59,182 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:19:59,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:19:59,191 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:19:59,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:19:59,211 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= (store |c_old(#valid)| |main_#t~malloc7.base| 0) |c_#valid|))) is different from true [2018-02-04 17:19:59,214 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:19:59,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:19:59,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:19:59,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:19:59,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:19:59,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:19:59,215 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2018-02-04 17:19:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:19:59,268 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-02-04 17:19:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:19:59,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 17:19:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:19:59,269 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:19:59,269 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 17:19:59,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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:19:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 17:19:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 17:19:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:19:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-02-04 17:19:59,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 27 [2018-02-04 17:19:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:19:59,271 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-02-04 17:19:59,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:19:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-02-04 17:19:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:19:59,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:19:59,272 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:19:59,272 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:19:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 622344746, now seen corresponding path program 2 times [2018-02-04 17:19:59,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:19:59,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:19:59,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:59,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:19:59,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:19:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:19:59,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:19:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:19:59,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:19:59,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:19:59,525 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:19:59,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:19:59,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:19:59,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:19:59,557 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:19:59,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:19:59,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:19:59,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:19:59,571 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:19:59,572 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:19:59,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:19:59,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:19:59,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:19:59,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:19:59,635 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:19:59,639 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:19:59,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:19:59,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:19:59,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:19:59,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-02-04 17:19:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:19:59,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:19:59,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-04 17:19:59,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:19:59,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:19:59,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:19:59,737 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 22 states. [2018-02-04 17:20:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:00,032 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 17:20:00,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:20:00,032 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-02-04 17:20:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:00,033 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:20:00,033 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 17:20:00,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:20:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 17:20:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 17:20:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:20:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-02-04 17:20:00,035 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 29 [2018-02-04 17:20:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:00,035 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-02-04 17:20:00,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:20:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-02-04 17:20:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:20:00,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:00,036 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:00,036 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1601005650, now seen corresponding path program 3 times [2018-02-04 17:20:00,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:00,036 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:00,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:00,037 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:00,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:00,048 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:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:20:00,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:00,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:00,191 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:20:00,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:20:00,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:00,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:00,230 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:00,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:00,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:00,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:20:00,237 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:00,238 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:00,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:00,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:00,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:00,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:20:00,255 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:00,261 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:00,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:00,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:00,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:00,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:20:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 17:20:00,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:20:00,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-02-04 17:20:00,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:20:00,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:20:00,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:20:00,317 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 15 states. [2018-02-04 17:20:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:00,547 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-04 17:20:00,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:20:00,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-04 17:20:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:00,547 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:20:00,547 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:20:00,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:20:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:20:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:20:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:20:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:20:00,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-02-04 17:20:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:00,548 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:20:00,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:20:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:20:00,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:20:00,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:20:00 BoogieIcfgContainer [2018-02-04 17:20:00,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:20:00,551 INFO L168 Benchmark]: Toolchain (without parser) took 3656.78 ms. Allocated memory was 403.2 MB in the beginning and 645.9 MB in the end (delta: 242.7 MB). Free memory was 359.6 MB in the beginning and 558.1 MB in the end (delta: -198.5 MB). Peak memory consumption was 44.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:00,552 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:00,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.53 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:00,552 INFO L168 Benchmark]: Boogie Preprocessor took 23.24 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:00,553 INFO L168 Benchmark]: RCFGBuilder took 306.63 ms. Allocated memory is still 403.2 MB. Free memory was 346.4 MB in the beginning and 329.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:00,553 INFO L168 Benchmark]: TraceAbstraction took 3171.60 ms. Allocated memory was 403.2 MB in the beginning and 645.9 MB in the end (delta: 242.7 MB). Free memory was 329.2 MB in the beginning and 558.1 MB in the end (delta: -228.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:20:00,554 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 152.53 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 23.24 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 306.63 ms. Allocated memory is still 403.2 MB. Free memory was 346.4 MB in the beginning and 329.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3171.60 ms. Allocated memory was 403.2 MB in the beginning and 645.9 MB in the end (delta: 242.7 MB). Free memory was 329.2 MB in the beginning and 558.1 MB in the end (delta: -228.9 MB). Peak memory consumption was 13.9 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: 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: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 9 error locations. SAFE Result, 3.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 252 SDtfs, 497 SDslu, 822 SDs, 0 SdLazy, 839 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 259 ConstructedInterpolants, 16 QuantifiedInterpolants, 65331 SizeOfPredicates, 25 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 20/82 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/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-20-00-559.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-20-00-559.csv Received shutdown request...