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-c17473d-m [2018-02-04 17:17:09,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:17:09,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:17:09,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:17:09,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:17:09,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:17:09,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:17:09,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:17:09,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:17:09,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:17:09,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:17:09,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:17:09,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:17:09,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:17:09,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:17:09,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:17:09,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:17:09,912 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:17:09,913 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:17:09,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:17:09,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:17:09,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:17:09,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:17:09,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:17:09,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:17:09,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:17:09,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:17:09,919 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:17:09,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:17:09,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:17:09,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:17:09,920 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:17:09,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:17:09,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:17:09,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:17:09,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:17:09,931 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:17:09,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:17:09,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:17:09,931 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:17:09,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:17:09,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:17:09,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:17:09,932 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:17:09,932 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:17:09,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:17:09,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:17:09,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:17:09,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:17:09,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:17:09,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:17:09,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:17:09,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:17:09,933 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:17:09,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:17:09,933 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:17:09,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:17:09,974 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:17:09,978 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:17:09,979 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:17:09,979 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:17:09,980 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-04 17:17:10,108 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:17:10,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:17:10,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:17:10,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:17:10,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:17:10,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25da0e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10, skipping insertion in model container [2018-02-04 17:17:10,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,127 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:17:10,153 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:17:10,243 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:17:10,255 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:17:10,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10 WrapperNode [2018-02-04 17:17:10,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:17:10,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:17:10,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:17:10,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:17:10,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... [2018-02-04 17:17:10,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:17:10,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:17:10,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:17:10,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:17:10,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:17:10,322 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:17:10,322 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:17:10,322 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:17:10,322 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:17:10,322 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:17:10,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:17:10,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:17:10,322 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:17:10,322 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:17:10,323 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:17:10,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:17:10,323 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:17:10,458 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:17:10,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:17:10 BoogieIcfgContainer [2018-02-04 17:17:10,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:17:10,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:17:10,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:17:10,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:17:10,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:17:10" (1/3) ... [2018-02-04 17:17:10,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1409ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:17:10, skipping insertion in model container [2018-02-04 17:17:10,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:10" (2/3) ... [2018-02-04 17:17:10,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1409ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:17:10, skipping insertion in model container [2018-02-04 17:17:10,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:17:10" (3/3) ... [2018-02-04 17:17:10,464 INFO L107 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:17:10,469 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:17:10,474 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 17:17:10,507 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:17:10,507 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:17:10,507 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:17:10,508 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:17:10,508 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:17:10,508 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:17:10,508 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:17:10,508 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:17:10,509 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:17:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-02-04 17:17:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:17:10,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:10,530 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:10,531 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1460855103, now seen corresponding path program 1 times [2018-02-04 17:17:10,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:10,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:10,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:10,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:10,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:10,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:10,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:10,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:17:10,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:17:10,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:17:10,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:17:10,677 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2018-02-04 17:17:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:10,763 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-04 17:17:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:17:10,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 17:17:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:10,770 INFO L225 Difference]: With dead ends: 42 [2018-02-04 17:17:10,770 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 17:17:10,772 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-04 17:17:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 17:17:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 17:17:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:17:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-02-04 17:17:10,839 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2018-02-04 17:17:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:10,839 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-02-04 17:17:10,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:17:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-02-04 17:17:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:17:10,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:10,840 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:10,840 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174720, now seen corresponding path program 1 times [2018-02-04 17:17:10,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:10,841 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:10,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:10,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:10,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:10,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:10,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:10,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:17:10,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:17:10,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:17:10,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:17:10,886 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-02-04 17:17:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:10,952 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-02-04 17:17:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:17:10,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:17:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:10,953 INFO L225 Difference]: With dead ends: 35 [2018-02-04 17:17:10,953 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:17:10,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:17:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:17:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:17:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:17:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-02-04 17:17:10,957 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-02-04 17:17:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:10,958 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-02-04 17:17:10,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:17:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-02-04 17:17:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:17:10,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:10,958 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:10,958 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:10,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174719, now seen corresponding path program 1 times [2018-02-04 17:17:10,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:10,959 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:10,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:10,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:10,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:10,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:11,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:11,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:17:11,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:17:11,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:17:11,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:17:11,061 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-02-04 17:17:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:11,221 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-04 17:17:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:17:11,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 17:17:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:11,223 INFO L225 Difference]: With dead ends: 69 [2018-02-04 17:17:11,223 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 17:17:11,223 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-04 17:17:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 17:17:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-02-04 17:17:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:17:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-02-04 17:17:11,228 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 14 [2018-02-04 17:17:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:11,228 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-02-04 17:17:11,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:17:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-02-04 17:17:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:17:11,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:11,229 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:11,229 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1688741209, now seen corresponding path program 1 times [2018-02-04 17:17:11,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:11,230 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:11,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,231 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:11,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:11,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:11,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:11,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:17:11,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:17:11,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:17:11,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:17:11,283 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 4 states. [2018-02-04 17:17:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:11,299 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-04 17:17:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:17:11,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 17:17:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:11,300 INFO L225 Difference]: With dead ends: 40 [2018-02-04 17:17:11,301 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:17:11,301 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-04 17:17:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:17:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-04 17:17:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:17:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-02-04 17:17:11,304 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 17 [2018-02-04 17:17:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:11,305 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-02-04 17:17:11,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:17:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-02-04 17:17:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:17:11,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:11,305 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:11,305 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2068353263, now seen corresponding path program 1 times [2018-02-04 17:17:11,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:11,306 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:11,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:11,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:11,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:11,347 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-04 17:17:11,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:11,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:11,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:11,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:11,393 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-04 17:17:11,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:17:11,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-02-04 17:17:11,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:17:11,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:17:11,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:17:11,394 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-02-04 17:17:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:11,415 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-02-04 17:17:11,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:17:11,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 17:17:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:11,416 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:17:11,416 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 17:17:11,416 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-04 17:17:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 17:17:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-02-04 17:17:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:17:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 17:17:11,419 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2018-02-04 17:17:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:11,419 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 17:17:11,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:17:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 17:17:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:17:11,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:11,421 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:11,421 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1639808019, now seen corresponding path program 1 times [2018-02-04 17:17:11,421 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:11,422 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:11,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,422 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:11,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:11,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:11,535 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-04 17:17:11,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:11,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:11,536 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:11,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:11,576 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-04 17:17:11,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:17:11,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:17:11,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:17:11,655 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-04 17:17:11,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:17:11,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-02-04 17:17:11,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:17:11,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:17:11,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:17:11,656 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 12 states. [2018-02-04 17:17:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:11,809 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-04 17:17:11,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:17:11,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-02-04 17:17:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:11,810 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:17:11,810 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:17:11,810 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-04 17:17:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:17:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-04 17:17:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:17:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-04 17:17:11,815 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2018-02-04 17:17:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:11,815 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-04 17:17:11,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:17:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-04 17:17:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:17:11,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:11,816 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:11,816 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:11,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1536064265, now seen corresponding path program 1 times [2018-02-04 17:17:11,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:11,816 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:11,817 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,817 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:11,817 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:11,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:11,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:11,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:11,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:11,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:11,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:17:11,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-02-04 17:17:11,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:17:11,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:17:11,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:17:11,971 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 12 states. [2018-02-04 17:17:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:12,125 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-02-04 17:17:12,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:17:12,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-04 17:17:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:12,132 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:17:12,132 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:17:12,132 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-04 17:17:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:17:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-04 17:17:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 17:17:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-04 17:17:12,136 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-02-04 17:17:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:12,136 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-04 17:17:12,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:17:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-04 17:17:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:17:12,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:12,137 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-04 17:17:12,137 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2040947294, now seen corresponding path program 1 times [2018-02-04 17:17:12,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:12,137 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:12,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,138 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:12,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:12,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:12,274 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-04 17:17:12,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:12,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:12,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:12,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:12,311 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-04 17:17:12,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:17:12,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-04 17:17:12,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:17:12,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:17:12,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:17:12,312 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 12 states. [2018-02-04 17:17:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:12,453 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 17:17:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:17:12,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 17:17:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:12,454 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:17:12,454 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:17:12,454 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-04 17:17:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:17:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-04 17:17:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 17:17:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-04 17:17:12,457 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-02-04 17:17:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:12,457 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-04 17:17:12,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:17:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-04 17:17:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:17:12,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:12,458 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-04 17:17:12,458 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2035165284, now seen corresponding path program 1 times [2018-02-04 17:17:12,458 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:12,458 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:12,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:12,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:12,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:12,573 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-04 17:17:12,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:12,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:12,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:12,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:12,615 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-04 17:17:12,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:17:12,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-02-04 17:17:12,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:17:12,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:17:12,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:17:12,616 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 15 states. [2018-02-04 17:17:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:12,883 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-02-04 17:17:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:17:12,884 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-02-04 17:17:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:12,884 INFO L225 Difference]: With dead ends: 94 [2018-02-04 17:17:12,884 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 17:17:12,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:17:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 17:17:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2018-02-04 17:17:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 17:17:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-02-04 17:17:12,888 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2018-02-04 17:17:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:12,888 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-02-04 17:17:12,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:17:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-02-04 17:17:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:17:12,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:12,889 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-04 17:17:12,889 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1450783205, now seen corresponding path program 1 times [2018-02-04 17:17:12,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:12,889 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:12,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:12,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:12,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:12,908 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:17:12,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:12,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:12,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:12,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:12,936 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 0)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-02-04 17:17:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:17:12,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:12,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:17:12,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:17:12,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:17:12,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-02-04 17:17:12,941 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 5 states. [2018-02-04 17:17:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:12,967 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-02-04 17:17:12,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:17:12,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-04 17:17:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:12,968 INFO L225 Difference]: With dead ends: 72 [2018-02-04 17:17:12,968 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:17:12,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-02-04 17:17:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:17:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:17:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:17:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-02-04 17:17:12,971 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2018-02-04 17:17:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:12,971 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-02-04 17:17:12,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:17:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-02-04 17:17:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:17:12,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:12,972 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:12,972 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 17:17:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash 262979632, now seen corresponding path program 2 times [2018-02-04 17:17:12,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:12,973 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:12,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:12,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:12,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:17:13,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:13,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:13,026 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:17:13,040 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:17:13,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:17:13,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:13,046 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-04 17:17:13,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:17:13,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:17:13,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:17:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 17:17:13,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:17:13,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-02-04 17:17:13,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:17:13,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:17:13,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:17:13,117 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 13 states. [2018-02-04 17:17:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:13,256 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-04 17:17:13,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:17:13,256 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-04 17:17:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:13,256 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:17:13,256 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:17:13,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:17:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:17:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:17:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:17:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:17:13,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-02-04 17:17:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:13,257 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:17:13,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:17:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:17:13,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:17:13,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:17:13 BoogieIcfgContainer [2018-02-04 17:17:13,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:17:13,262 INFO L168 Benchmark]: Toolchain (without parser) took 3153.75 ms. Allocated memory was 402.7 MB in the beginning and 668.5 MB in the end (delta: 265.8 MB). Free memory was 359.3 MB in the beginning and 528.2 MB in the end (delta: -168.8 MB). Peak memory consumption was 97.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:13,263 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:17:13,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.61 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:13,263 INFO L168 Benchmark]: Boogie Preprocessor took 23.69 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 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 17:17:13,264 INFO L168 Benchmark]: RCFGBuilder took 173.52 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 328.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:13,264 INFO L168 Benchmark]: TraceAbstraction took 2802.59 ms. Allocated memory was 402.7 MB in the beginning and 668.5 MB in the end (delta: 265.8 MB). Free memory was 328.9 MB in the beginning and 528.2 MB in the end (delta: -199.2 MB). Peak memory consumption was 66.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:13,265 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.21 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.61 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.69 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 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 173.52 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 328.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2802.59 ms. Allocated memory was 402.7 MB in the beginning and 668.5 MB in the end (delta: 265.8 MB). Free memory was 328.9 MB in the beginning and 528.2 MB in the end (delta: -199.2 MB). Peak memory consumption was 66.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 9 error locations. SAFE Result, 2.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 308 SDtfs, 1198 SDslu, 763 SDs, 0 SdLazy, 736 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, 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, 11 MinimizatonAttempts, 83 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 369 ConstructedInterpolants, 8 QuantifiedInterpolants, 63669 SizeOfPredicates, 15 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 50/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-17-13-270.csv 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-TraceAbstractionBenchmarks-0-2018-02-04_17-17-13-270.csv Received shutdown request...