java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:59:05,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:59:05,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:59:05,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:59:05,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:59:05,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:59:05,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:59:05,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:59:05,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:59:05,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:59:05,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:59:05,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:59:05,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:59:05,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:59:05,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:59:05,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:59:05,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:59:05,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:59:05,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:59:05,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:59:05,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:59:05,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:59:05,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:59:05,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:59:05,794 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:59:05,795 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:59:05,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:59:05,796 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:59:05,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:59:05,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:59:05,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:59:05,797 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-02 20:59:05,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:59:05,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:59:05,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:59:05,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:59:05,809 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:59:05,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:59:05,810 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:59:05,810 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:59:05,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:59:05,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:59:05,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:59:05,810 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:59:05,811 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:59:05,811 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:59:05,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:59:05,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:59:05,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:59:05,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:59:05,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:59:05,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:59:05,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:59:05,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:59:05,812 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 20:59:05,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 20:59:05,812 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 20:59:05,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:59:05,858 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:59:05,862 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:59:05,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:59:05,863 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:59:05,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:05,999 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:59:06,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:59:06,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:06,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:59:06,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:59:06,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:05" (1/1) ... [2018-02-02 20:59:06,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af2d12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06, skipping insertion in model container [2018-02-02 20:59:06,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:05" (1/1) ... [2018-02-02 20:59:06,026 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:06,056 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:06,150 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:06,161 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:06,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06 WrapperNode [2018-02-02 20:59:06,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:06,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:59:06,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:59:06,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:59:06,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (1/1) ... [2018-02-02 20:59:06,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (1/1) ... [2018-02-02 20:59:06,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (1/1) ... [2018-02-02 20:59:06,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (1/1) ... [2018-02-02 20:59:06,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (1/1) ... [2018-02-02 20:59:06,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (1/1) ... [2018-02-02 20:59:06,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (1/1) ... [2018-02-02 20:59:06,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:59:06,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:59:06,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:59:06,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:59:06,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (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-02 20:59:06,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:59:06,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:59:06,232 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:59:06,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:59:06,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:59:06,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:59:06,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:59:06,232 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:59:06,232 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:59:06,233 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:59:06,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:59:06,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:59:06,372 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:59:06,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:06 BoogieIcfgContainer [2018-02-02 20:59:06,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:59:06,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:59:06,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:59:06,375 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:59:06,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:59:05" (1/3) ... [2018-02-02 20:59:06,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721de6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:06, skipping insertion in model container [2018-02-02 20:59:06,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:06" (2/3) ... [2018-02-02 20:59:06,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721de6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:06, skipping insertion in model container [2018-02-02 20:59:06,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:06" (3/3) ... [2018-02-02 20:59:06,377 INFO L107 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:06,382 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:59:06,386 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 20:59:06,418 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:59:06,418 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:59:06,418 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 20:59:06,418 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 20:59:06,419 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:59:06,419 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:59:06,419 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:59:06,419 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:59:06,420 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:59:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-02-02 20:59:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:59:06,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:06,440 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:06,440 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1460855103, now seen corresponding path program 1 times [2018-02-02 20:59:06,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:06,446 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:06,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:06,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:06,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:06,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:06,611 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-02 20:59:06,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:06,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:06,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:59:06,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:59:06,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:06,628 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2018-02-02 20:59:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:06,700 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-02 20:59:06,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:59:06,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 20:59:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:06,754 INFO L225 Difference]: With dead ends: 42 [2018-02-02 20:59:06,754 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 20:59:06,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 20:59:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 20:59:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 20:59:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-02-02 20:59:06,777 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2018-02-02 20:59:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:06,777 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-02-02 20:59:06,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:59:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-02-02 20:59:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:59:06,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:06,778 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:06,778 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174720, now seen corresponding path program 1 times [2018-02-02 20:59:06,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:06,779 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:06,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:06,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:06,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:06,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:06,822 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-02 20:59:06,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:06,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:59:06,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:59:06,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:59:06,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:06,824 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-02-02 20:59:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:06,863 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-02-02 20:59:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:59:06,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 20:59:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:06,864 INFO L225 Difference]: With dead ends: 35 [2018-02-02 20:59:06,864 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 20:59:06,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 20:59:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 20:59:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 20:59:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-02-02 20:59:06,869 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-02-02 20:59:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:06,869 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-02-02 20:59:06,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:59:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-02-02 20:59:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:59:06,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:06,870 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:06,870 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174719, now seen corresponding path program 1 times [2018-02-02 20:59:06,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:06,870 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:06,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:06,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:06,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:06,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:06,991 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-02 20:59:06,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:06,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:59:06,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:59:06,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:59:06,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:59:06,992 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-02-02 20:59:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:07,153 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-02 20:59:07,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:59:07,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 20:59:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:07,154 INFO L225 Difference]: With dead ends: 69 [2018-02-02 20:59:07,154 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 20:59:07,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:59:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 20:59:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-02-02 20:59:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 20:59:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-02-02 20:59:07,157 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 14 [2018-02-02 20:59:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:07,157 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-02-02 20:59:07,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:59:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-02-02 20:59:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:59:07,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:07,158 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:07,158 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1688741209, now seen corresponding path program 1 times [2018-02-02 20:59:07,158 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:07,158 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:07,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:07,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:07,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:07,180 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-02 20:59:07,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:07,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:07,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:59:07,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:59:07,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:07,182 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 4 states. [2018-02-02 20:59:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:07,208 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-02 20:59:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:59:07,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 20:59:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:07,209 INFO L225 Difference]: With dead ends: 40 [2018-02-02 20:59:07,209 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 20:59:07,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 20:59:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-02 20:59:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 20:59:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-02-02 20:59:07,213 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 17 [2018-02-02 20:59:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:07,213 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-02-02 20:59:07,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:59:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-02-02 20:59:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:59:07,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:07,214 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:07,214 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2068353263, now seen corresponding path program 1 times [2018-02-02 20:59:07,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:07,215 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:07,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,215 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:07,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:07,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:07,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:07,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:07,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:07,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:07,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:59:07,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-02-02 20:59:07,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:59:07,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:59:07,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:59:07,294 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-02-02 20:59:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:07,324 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-02-02 20:59:07,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:59:07,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 20:59:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:07,325 INFO L225 Difference]: With dead ends: 68 [2018-02-02 20:59:07,325 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 20:59:07,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:59:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 20:59:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-02-02 20:59:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 20:59:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 20:59:07,328 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2018-02-02 20:59:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:07,329 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 20:59:07,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:59:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 20:59:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:59:07,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:07,329 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:07,329 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1639808019, now seen corresponding path program 1 times [2018-02-02 20:59:07,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:07,330 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:07,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,330 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:07,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:07,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:07,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:07,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:07,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:07,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:07,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 20:59:07,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:07,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:07,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-02 20:59:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:07,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:07,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-02-02 20:59:07,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:59:07,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:59:07,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:59:07,578 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 12 states. [2018-02-02 20:59:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:07,735 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-02 20:59:07,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:59:07,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-02-02 20:59:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:07,736 INFO L225 Difference]: With dead ends: 49 [2018-02-02 20:59:07,736 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 20:59:07,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:59:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 20:59:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-02 20:59:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 20:59:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-02 20:59:07,740 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2018-02-02 20:59:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:07,741 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-02 20:59:07,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:59:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-02 20:59:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:59:07,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:07,742 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:07,742 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1536064265, now seen corresponding path program 1 times [2018-02-02 20:59:07,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:07,742 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:07,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:07,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:07,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:07,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:07,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:07,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:07,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:07,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:07,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-02-02 20:59:07,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:59:07,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:59:07,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:59:07,902 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 12 states. [2018-02-02 20:59:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:08,047 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-02-02 20:59:08,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:59:08,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-02 20:59:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:08,048 INFO L225 Difference]: With dead ends: 59 [2018-02-02 20:59:08,048 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 20:59:08,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:59:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 20:59:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-02 20:59:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 20:59:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-02 20:59:08,051 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-02-02 20:59:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:08,052 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-02 20:59:08,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:59:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-02 20:59:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:59:08,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:08,052 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:08,052 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2040947294, now seen corresponding path program 1 times [2018-02-02 20:59:08,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:08,053 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:08,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:08,053 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:08,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:08,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:08,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:08,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:08,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:08,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:59:08,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:59:08,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-02 20:59:08,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:59:08,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:59:08,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:59:08,217 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 12 states. [2018-02-02 20:59:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:08,410 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-02 20:59:08,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:59:08,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 20:59:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:08,411 INFO L225 Difference]: With dead ends: 73 [2018-02-02 20:59:08,411 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 20:59:08,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:59:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 20:59:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-02 20:59:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 20:59:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-02 20:59:08,415 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-02-02 20:59:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:08,416 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-02 20:59:08,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:59:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-02 20:59:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:59:08,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:08,417 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:08,417 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2035165284, now seen corresponding path program 1 times [2018-02-02 20:59:08,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:08,417 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:08,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:08,418 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:08,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:08,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:08,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:08,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:08,632 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:08,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:08,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:08,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-02-02 20:59:08,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:59:08,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:59:08,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:59:08,687 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 15 states. [2018-02-02 20:59:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:08,939 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-02-02 20:59:08,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:59:08,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-02-02 20:59:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:08,939 INFO L225 Difference]: With dead ends: 94 [2018-02-02 20:59:08,940 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 20:59:08,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:59:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 20:59:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2018-02-02 20:59:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 20:59:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-02-02 20:59:08,943 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2018-02-02 20:59:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:08,944 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-02-02 20:59:08,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:59:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-02-02 20:59:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:59:08,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:08,944 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:08,944 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 20:59:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1450783205, now seen corresponding path program 1 times [2018-02-02 20:59:08,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:08,945 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:08,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:08,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:08,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:08,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:08,962 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 20:59:08,965 INFO L168 Benchmark]: Toolchain (without parser) took 2965.30 ms. Allocated memory was 393.2 MB in the beginning and 660.6 MB in the end (delta: 267.4 MB). Free memory was 351.2 MB in the beginning and 604.0 MB in the end (delta: -252.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:08,966 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 393.2 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:08,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.11 ms. Allocated memory is still 393.2 MB. Free memory was 349.9 MB in the beginning and 340.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:08,967 INFO L168 Benchmark]: Boogie Preprocessor took 27.32 ms. Allocated memory is still 393.2 MB. Free memory was 340.7 MB in the beginning and 338.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:08,967 INFO L168 Benchmark]: RCFGBuilder took 178.30 ms. Allocated memory is still 393.2 MB. Free memory was 338.0 MB in the beginning and 319.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:08,967 INFO L168 Benchmark]: TraceAbstraction took 2591.59 ms. Allocated memory was 393.2 MB in the beginning and 660.6 MB in the end (delta: 267.4 MB). Free memory was 319.5 MB in the beginning and 604.0 MB in the end (delta: -284.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:08,969 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 393.2 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.11 ms. Allocated memory is still 393.2 MB. Free memory was 349.9 MB in the beginning and 340.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.32 ms. Allocated memory is still 393.2 MB. Free memory was 340.7 MB in the beginning and 338.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 178.30 ms. Allocated memory is still 393.2 MB. Free memory was 338.0 MB in the beginning and 319.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2591.59 ms. Allocated memory was 393.2 MB in the beginning and 660.6 MB in the end (delta: 267.4 MB). Free memory was 319.5 MB in the beginning and 604.0 MB in the end (delta: -284.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-59-08-975.csv Received shutdown request...