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/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:14:55,023 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:14:55,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:14:55,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:14:55,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:14:55,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:14:55,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:14:55,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:14:55,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:14:55,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:14:55,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:14:55,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:14:55,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:14:55,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:14:55,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:14:55,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:14:55,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:14:55,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:14:55,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:14:55,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:14:55,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:14:55,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:14:55,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:14:55,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:14:55,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:14:55,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:14:55,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:14:55,055 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:14:55,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:14:55,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:14:55,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:14:55,056 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 19:14:55,065 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:14:55,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:14:55,066 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:14:55,066 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:14:55,066 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:14:55,066 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:14:55,067 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:14:55,067 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:14:55,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:14:55,067 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:14:55,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:14:55,067 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:14:55,068 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:14:55,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:14:55,068 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:14:55,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:14:55,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:14:55,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:14:55,069 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:14:55,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:14:55,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:14:55,069 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:14:55,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:14:55,069 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:14:55,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:14:55,114 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:14:55,117 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:14:55,118 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:14:55,118 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:14:55,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-04 19:14:55,280 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:14:55,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:14:55,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:14:55,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:14:55,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:14:55,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692a7dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55, skipping insertion in model container [2018-02-04 19:14:55,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,299 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:14:55,332 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:14:55,418 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:14:55,433 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:14:55,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55 WrapperNode [2018-02-04 19:14:55,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:14:55,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:14:55,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:14:55,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:14:55,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (1/1) ... [2018-02-04 19:14:55,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:14:55,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:14:55,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:14:55,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:14:55,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (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 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:14:55,501 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-02-04 19:14:55,502 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:14:55,503 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:14:55,503 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:14:55,503 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:14:55,644 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:14:55,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:14:55 BoogieIcfgContainer [2018-02-04 19:14:55,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:14:55,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:14:55,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:14:55,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:14:55,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:14:55" (1/3) ... [2018-02-04 19:14:55,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c156a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:14:55, skipping insertion in model container [2018-02-04 19:14:55,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:55" (2/3) ... [2018-02-04 19:14:55,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c156a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:14:55, skipping insertion in model container [2018-02-04 19:14:55,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:14:55" (3/3) ... [2018-02-04 19:14:55,648 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-04 19:14:55,654 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:14:55,658 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 19:14:55,687 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:14:55,687 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:14:55,687 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:14:55,687 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:14:55,687 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:14:55,687 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:14:55,687 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:14:55,688 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:14:55,688 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:14:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-04 19:14:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:14:55,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:55,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:14:55,706 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash 3053611, now seen corresponding path program 1 times [2018-02-04 19:14:55,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:55,712 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:55,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:55,746 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:55,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:55,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:55,804 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 19:14:55,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:55,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:14:55,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:14:55,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:14:55,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:14:55,815 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-02-04 19:14:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:55,933 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 19:14:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:14:55,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:14:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:55,942 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:14:55,942 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 19:14:55,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:14:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 19:14:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-02-04 19:14:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 19:14:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 19:14:55,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2018-02-04 19:14:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:55,969 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 19:14:55,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:14:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 19:14:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:14:55,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:55,969 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:14:55,970 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 3053612, now seen corresponding path program 1 times [2018-02-04 19:14:55,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:55,970 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:55,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:55,972 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:55,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:55,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:56,021 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 19:14:56,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:14:56,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:14:56,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:14:56,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:14:56,027 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-02-04 19:14:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:56,067 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-02-04 19:14:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:14:56,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:14:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:56,069 INFO L225 Difference]: With dead ends: 110 [2018-02-04 19:14:56,069 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 19:14:56,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:14:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 19:14:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-02-04 19:14:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 19:14:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-02-04 19:14:56,079 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 4 [2018-02-04 19:14:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:56,080 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-02-04 19:14:56,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:14:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-02-04 19:14:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:14:56,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:56,081 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] [2018-02-04 19:14:56,081 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066521, now seen corresponding path program 1 times [2018-02-04 19:14:56,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:56,082 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:56,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:56,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:56,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:56,166 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 19:14:56,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:14:56,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:14:56,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:14:56,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:14:56,167 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 5 states. [2018-02-04 19:14:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:56,193 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-02-04 19:14:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:14:56,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 19:14:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:56,197 INFO L225 Difference]: With dead ends: 78 [2018-02-04 19:14:56,197 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 19:14:56,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:14:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 19:14:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-04 19:14:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 19:14:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-04 19:14:56,203 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2018-02-04 19:14:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:56,204 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-04 19:14:56,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:14:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-04 19:14:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:14:56,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:56,205 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] [2018-02-04 19:14:56,205 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 995391925, now seen corresponding path program 1 times [2018-02-04 19:14:56,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:56,205 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:56,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:56,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:56,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:56,268 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 19:14:56,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:14:56,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:56,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:56,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:56,269 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2018-02-04 19:14:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:56,300 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-04 19:14:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:14:56,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:14:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:56,301 INFO L225 Difference]: With dead ends: 76 [2018-02-04 19:14:56,301 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 19:14:56,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:14:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 19:14:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 19:14:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 19:14:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 19:14:56,307 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 24 [2018-02-04 19:14:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:56,307 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 19:14:56,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 19:14:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:14:56,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:56,308 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] [2018-02-04 19:14:56,308 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:56,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763835, now seen corresponding path program 1 times [2018-02-04 19:14:56,308 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:56,308 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:56,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,309 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:56,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:56,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:56,370 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 19:14:56,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:14:56,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:56,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:56,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:56,372 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-02-04 19:14:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:56,405 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 19:14:56,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:14:56,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:14:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:56,406 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:14:56,406 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:14:56,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:14:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:14:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 19:14:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 19:14:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-04 19:14:56,411 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 26 [2018-02-04 19:14:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:56,411 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-04 19:14:56,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-04 19:14:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:14:56,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:56,413 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] [2018-02-04 19:14:56,413 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763836, now seen corresponding path program 1 times [2018-02-04 19:14:56,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:56,413 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:56,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:56,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:56,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:56,463 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 19:14:56,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:14:56,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:56,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:56,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:56,464 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 6 states. [2018-02-04 19:14:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:56,527 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-04 19:14:56,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:14:56,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:14:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:56,528 INFO L225 Difference]: With dead ends: 74 [2018-02-04 19:14:56,528 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 19:14:56,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:14:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 19:14:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 19:14:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 19:14:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 19:14:56,532 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 26 [2018-02-04 19:14:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:56,532 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 19:14:56,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 19:14:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:14:56,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:56,533 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] [2018-02-04 19:14:56,533 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -772946127, now seen corresponding path program 1 times [2018-02-04 19:14:56,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:56,533 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:56,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,534 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:56,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:56,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:56,570 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 19:14:56,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:14:56,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:14:56,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:14:56,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:14:56,571 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-02-04 19:14:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:56,611 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 19:14:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:14:56,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-02-04 19:14:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:56,612 INFO L225 Difference]: With dead ends: 77 [2018-02-04 19:14:56,612 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 19:14:56,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 19:14:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 19:14:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 19:14:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 19:14:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 19:14:56,616 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 25 [2018-02-04 19:14:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:56,617 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 19:14:56,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:14:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 19:14:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:14:56,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:56,618 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, 1, 1, 1, 1, 1] [2018-02-04 19:14:56,618 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:56,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706416, now seen corresponding path program 1 times [2018-02-04 19:14:56,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:56,618 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:56,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:56,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:56,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:56,643 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:56,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:56,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:56,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:56,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:56,715 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 19:14:56,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:56,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:56,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:14:56,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:56,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:56,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:14:56,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:56,778 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 19:14:56,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:14:56,861 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 19:14:56,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:14:56,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:14:56,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:14:56,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:14:56,862 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 9 states. [2018-02-04 19:14:57,158 WARN L143 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 18 [2018-02-04 19:14:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:57,574 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-04 19:14:57,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:14:57,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:14:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:57,575 INFO L225 Difference]: With dead ends: 65 [2018-02-04 19:14:57,575 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 19:14:57,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:14:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 19:14:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-04 19:14:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:14:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 19:14:57,577 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 32 [2018-02-04 19:14:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:57,577 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 19:14:57,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:14:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 19:14:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:14:57,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:57,578 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, 1, 1, 1, 1, 1] [2018-02-04 19:14:57,578 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:14:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706417, now seen corresponding path program 1 times [2018-02-04 19:14:57,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:57,578 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:57,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:57,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:57,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:57,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:57,592 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:57,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:57,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:57,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:57,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:57,628 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 19:14:57,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,635 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 19:14:57,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:14:57,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,707 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 32 treesize of output 35 [2018-02-04 19:14:57,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-02-04 19:14:57,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-02-04 19:14:57,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 19:14:57,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:14:57,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:15:00,104 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 19:15:00,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:00,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:15:00,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:15:00,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:15:00,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=53, Unknown=3, NotChecked=0, Total=72 [2018-02-04 19:15:00,107 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2018-02-04 19:15:28,128 WARN L146 SmtUtils]: Spent 20409ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 19:15:40,232 WARN L143 SmtUtils]: Spent 12080ms on a formula simplification that was a NOOP. DAG size: 59 [2018-02-04 19:15:49,423 WARN L146 SmtUtils]: Spent 8131ms on a formula simplification. DAG size of input: 47 DAG size of output 42 [2018-02-04 19:16:01,651 WARN L143 SmtUtils]: Spent 12191ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 19:16:09,791 WARN L143 SmtUtils]: Spent 8102ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 19:16:31,161 WARN L146 SmtUtils]: Spent 20179ms on a formula simplification. DAG size of input: 61 DAG size of output 61 [2018-02-04 19:16:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:16:31,232 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 19:16:31,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:16:31,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:16:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:16:31,234 INFO L225 Difference]: With dead ends: 63 [2018-02-04 19:16:31,234 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 19:16:31,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 87.1s TimeCoverageRelationStatistics Valid=81, Invalid=247, Unknown=14, NotChecked=0, Total=342 [2018-02-04 19:16:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 19:16:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-02-04 19:16:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 19:16:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-02-04 19:16:31,239 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 32 [2018-02-04 19:16:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:16:31,239 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-02-04 19:16:31,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:16:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-02-04 19:16:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:16:31,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:16:31,240 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, 1, 1, 1, 1, 1] [2018-02-04 19:16:31,241 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:16:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2490893, now seen corresponding path program 1 times [2018-02-04 19:16:31,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:16:31,241 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:16:31,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:16:31,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:16:31,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:16:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:16:31,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:16:31,259 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:16:31,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:16:31,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:16:31,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:16:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:16:31,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:16:31,289 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 19:16:31,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:16:31,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:16:31,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 19:16:31,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-02-04 19:16:31,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,347 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 19:16:31,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:16:31,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:16:31,372 WARN L1033 $PredicateComparison]: unable to prove that (exists ((probe1_6_~p~0.base Int)) (and (<= (select |c_old(#valid)| probe1_6_~p~0.base) 0) (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base 0)) (not (= probe1_6_~p~0.base 0)))) is different from true [2018-02-04 19:16:31,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-02-04 19:16:31,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,391 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 19:16:31,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-02-04 19:16:31,403 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 19:16:31,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:16:31,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:16:31,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:16:31,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:16:31,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2018-02-04 19:16:31,403 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 12 states. [2018-02-04 19:16:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:16:31,573 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 19:16:31,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:16:31,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 19:16:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:16:31,574 INFO L225 Difference]: With dead ends: 62 [2018-02-04 19:16:31,574 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 19:16:31,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=238, Unknown=1, NotChecked=32, Total=342 [2018-02-04 19:16:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 19:16:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-02-04 19:16:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 19:16:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-04 19:16:31,576 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 32 [2018-02-04 19:16:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:16:31,576 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-04 19:16:31,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:16:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-04 19:16:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:16:31,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:16:31,577 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, 1, 1, 1, 1, 1] [2018-02-04 19:16:31,577 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:16:31,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2490894, now seen corresponding path program 1 times [2018-02-04 19:16:31,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:16:31,577 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:16:31,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:16:31,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:16:31,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:16:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:16:31,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:16:31,591 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:16:31,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:16:31,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:16:31,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:16:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:16:31,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:16:31,616 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 19:16:31,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,624 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 19:16:31,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:16:31,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:16:31,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:16:31,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 19:16:31,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 19:16:31,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,704 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 24 treesize of output 23 [2018-02-04 19:16:31,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,723 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 17 treesize of output 16 [2018-02-04 19:16:31,724 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-02-04 19:16:31,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:16:31,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:47, output treesize:35 [2018-02-04 19:16:31,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 19:16:31,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,878 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 26 treesize of output 25 [2018-02-04 19:16:31,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-02-04 19:16:31,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:16:31,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-04 19:16:31,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:16:31,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:16:31,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:16:31,963 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 19:16:31,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:16:31,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:16:31,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:16:31,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:16:31,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=24, Unknown=4, NotChecked=0, Total=42 [2018-02-04 19:16:31,964 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 7 states. [2018-02-04 19:17:03,557 WARN L146 SmtUtils]: Spent 26437ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-02-04 19:17:28,329 WARN L146 SmtUtils]: Spent 24758ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-02-04 19:17:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:17:28,403 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-02-04 19:17:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:17:28,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 19:17:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:17:28,404 INFO L225 Difference]: With dead ends: 57 [2018-02-04 19:17:28,404 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 19:17:28,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=41, Invalid=85, Unknown=6, NotChecked=0, Total=132 [2018-02-04 19:17:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 19:17:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-02-04 19:17:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 19:17:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 19:17:28,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 32 [2018-02-04 19:17:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:17:28,407 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 19:17:28,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:17:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 19:17:28,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:17:28,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:17:28,408 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:17:28,408 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:17:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1191758230, now seen corresponding path program 1 times [2018-02-04 19:17:28,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:17:28,409 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:17:28,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:17:28,410 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:17:28,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:17:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:17:28,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:17:28,433 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:17:28,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:17:28,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:17:28,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:17:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:17:28,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:17:28,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:17:28,501 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 19:17:28,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:17:28,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:17:28,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-02-04 19:17:28,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:17:28,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:17:28,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:17:28,541 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 19:17:28,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:17:28,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:17:28,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:17:28,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:17:28,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=61, Unknown=5, NotChecked=0, Total=90 [2018-02-04 19:17:28,542 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 10 states. [2018-02-04 19:17:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:17:28,654 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 19:17:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:17:28,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-02-04 19:17:28,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:17:28,655 INFO L225 Difference]: With dead ends: 60 [2018-02-04 19:17:28,655 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 19:17:28,655 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=112, Unknown=5, NotChecked=0, Total=156 [2018-02-04 19:17:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 19:17:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 19:17:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 19:17:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 19:17:28,657 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 35 [2018-02-04 19:17:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:17:28,658 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 19:17:28,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:17:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 19:17:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:17:28,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:17:28,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:17:28,659 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:17:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2029507581, now seen corresponding path program 1 times [2018-02-04 19:17:28,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:17:28,659 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:17:28,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:17:28,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:17:28,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:17:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:17:28,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:17:28,694 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 19:17:28,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:17:28,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:17:28,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:17:28,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:17:28,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:17:28,696 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-02-04 19:17:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:17:28,701 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-02-04 19:17:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:17:28,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 19:17:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:17:28,702 INFO L225 Difference]: With dead ends: 46 [2018-02-04 19:17:28,702 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 19:17:28,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:17:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 19:17:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 19:17:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 19:17:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-02-04 19:17:28,705 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-02-04 19:17:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:17:28,705 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-02-04 19:17:28,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:17:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-02-04 19:17:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 19:17:28,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:17:28,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:17:28,706 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:17:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1307871834, now seen corresponding path program 1 times [2018-02-04 19:17:28,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:17:28,707 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:17:28,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:17:28,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:17:28,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:17:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:17:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:17:28,749 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:17:28,763 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 19:17:28,767 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:17:28,767 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:17:28,768 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:17:28,768 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:17:28,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:17:28 BoogieIcfgContainer [2018-02-04 19:17:28,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:17:28,779 INFO L168 Benchmark]: Toolchain (without parser) took 153498.71 ms. Allocated memory was 405.3 MB in the beginning and 653.3 MB in the end (delta: 248.0 MB). Free memory was 362.0 MB in the beginning and 540.2 MB in the end (delta: -178.2 MB). Peak memory consumption was 69.8 MB. Max. memory is 5.3 GB. [2018-02-04 19:17:28,780 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:17:28,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.57 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:17:28,780 INFO L168 Benchmark]: Boogie Preprocessor took 25.98 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:17:28,781 INFO L168 Benchmark]: RCFGBuilder took 177.71 ms. Allocated memory is still 405.3 MB. Free memory was 346.1 MB in the beginning and 326.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 19:17:28,781 INFO L168 Benchmark]: TraceAbstraction took 153133.94 ms. Allocated memory was 405.3 MB in the beginning and 653.3 MB in the end (delta: 248.0 MB). Free memory was 326.3 MB in the beginning and 540.2 MB in the end (delta: -213.9 MB). Peak memory consumption was 34.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:17:28,782 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.13 ms. Allocated memory is still 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.57 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.98 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 177.71 ms. Allocated memory is still 405.3 MB. Free memory was 346.1 MB in the beginning and 326.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 153133.94 ms. Allocated memory was 405.3 MB in the beginning and 653.3 MB in the end (delta: 248.0 MB). Free memory was 326.3 MB in the beginning and 540.2 MB in the end (delta: -213.9 MB). Peak memory consumption was 34.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1476]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={9:5}] [L1465] FCALL struct A a6; VAL [a6={7:0}] [L1477] CALL entry_point() VAL [a6={7:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={7:0}, a6={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, a6={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={7:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={7:0}, malloc(size)={8:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={8:0}, a6={7:0}, malloc(size)={8:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={8:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={7:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={8:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={7:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={8:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1469] EXPR probe1_6(&a6) VAL [a6={7:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [L1470] COND TRUE ret==0 VAL [a6={7:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={7:0}, ret=0] [L1473] RET, FCALL a6.p = 0 VAL [a6={7:0}, ret=0] [L1477] entry_point() VAL [a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 59 locations, 9 error locations. UNSAFE Result, 153.0s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 148.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 624 SDtfs, 548 SDslu, 1325 SDs, 0 SdLazy, 981 SolverSat, 170 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 130 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 139.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=2, 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, 13 MinimizatonAttempts, 34 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 324 ConstructedInterpolants, 75 QuantifiedInterpolants, 103204 SizeOfPredicates, 32 NumberOfNonLiveVariables, 738 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-17-28-788.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-17-28-788.csv Received shutdown request...