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/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:32:25,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:32:25,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:32:25,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:32:25,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:32:25,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:32:25,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:32:25,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:32:25,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:32:25,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:32:25,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:32:25,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:32:25,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:32:25,246 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:32:25,247 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:32:25,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:32:25,250 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:32:25,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:32:25,253 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:32:25,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:32:25,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:32:25,256 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:32:25,256 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:32:25,257 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:32:25,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:32:25,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:32:25,258 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:32:25,259 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:32:25,259 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:32:25,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:32:25,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:32:25,260 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:32:25,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:32:25,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:32:25,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:32:25,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:32:25,269 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:32:25,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:32:25,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:32:25,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:32:25,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:32:25,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:32:25,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:32:25,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:32:25,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:32:25,271 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:32:25,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:32:25,272 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:32:25,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:32:25,305 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:32:25,307 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:32:25,308 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:32:25,308 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:32:25,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:32:25,429 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:32:25,430 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:32:25,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:32:25,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:32:25,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:32:25,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e54bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25, skipping insertion in model container [2018-02-04 17:32:25,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,445 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:32:25,472 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:32:25,557 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:32:25,572 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:32:25,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25 WrapperNode [2018-02-04 17:32:25,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:32:25,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:32:25,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:32:25,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:32:25,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (1/1) ... [2018-02-04 17:32:25,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:32:25,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:32:25,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:32:25,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:32:25,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (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:32:25,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:32:25,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:32:25,650 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-02-04 17:32:25,650 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:32:25,650 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:32:25,650 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:32:25,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:32:25,810 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:32:25,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:32:25 BoogieIcfgContainer [2018-02-04 17:32:25,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:32:25,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:32:25,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:32:25,813 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:32:25,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:32:25" (1/3) ... [2018-02-04 17:32:25,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2093d17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:32:25, skipping insertion in model container [2018-02-04 17:32:25,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:25" (2/3) ... [2018-02-04 17:32:25,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2093d17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:32:25, skipping insertion in model container [2018-02-04 17:32:25,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:32:25" (3/3) ... [2018-02-04 17:32:25,815 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:32:25,820 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:32:25,825 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 17:32:25,846 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:32:25,847 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:32:25,847 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:32:25,847 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:32:25,847 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:32:25,847 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:32:25,847 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:32:25,847 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:32:25,848 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:32:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-04 17:32:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:32:25,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:25,862 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:25,862 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-02-04 17:32:25,865 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:25,866 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:25,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:25,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:25,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:25,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:25,945 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:25,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:25,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:25,946 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:25,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:26,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:26,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:32:26,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:32:26,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:32:26,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:32:26,074 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:32:26,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:26,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:32:26,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:32:26,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:32:26,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:32:26,140 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-04 17:32:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:26,208 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 17:32:26,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:32:26,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 17:32:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:26,218 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:32:26,218 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:32:26,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 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:32:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:32:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 17:32:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:32:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 17:32:26,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-04 17:32:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:26,251 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 17:32:26,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:32:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 17:32:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:32:26,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:26,252 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:26,252 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-02-04 17:32:26,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:26,253 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:26,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:26,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:26,275 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:26,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:26,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:26,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:26,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:26,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:26,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:32:26,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:26,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:26,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:32:26,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:32:26,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:26,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:32:26,413 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:32:26,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:26,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:32:26,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:32:26,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:32:26,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:32:26,415 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-04 17:32:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:26,488 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 17:32:26,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:32:26,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:32:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:26,489 INFO L225 Difference]: With dead ends: 40 [2018-02-04 17:32:26,489 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:32:26,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:32:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:32:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 17:32:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:32:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 17:32:26,493 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-04 17:32:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:26,494 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 17:32:26,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:32:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 17:32:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:32:26,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:26,495 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:26,495 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-02-04 17:32:26,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:26,495 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:26,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:26,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:26,532 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:32:26,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:26,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:32:26,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:32:26,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:32:26,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:32:26,533 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-04 17:32:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:26,558 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 17:32:26,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:32:26,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:32:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:26,558 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:32:26,558 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 17:32:26,559 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:32:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 17:32:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 17:32:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:32:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 17:32:26,561 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-04 17:32:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:26,561 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 17:32:26,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:32:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 17:32:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:32:26,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:26,562 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:26,562 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-02-04 17:32:26,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:26,562 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:26,562 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:26,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:26,609 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:32:26,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:26,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:32:26,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:32:26,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:32:26,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:32:26,610 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-04 17:32:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:26,631 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-04 17:32:26,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:32:26,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:32:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:26,632 INFO L225 Difference]: With dead ends: 38 [2018-02-04 17:32:26,632 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:32:26,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:32:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:32:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 17:32:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:32:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 17:32:26,635 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-04 17:32:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:26,636 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 17:32:26,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:32:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 17:32:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:32:26,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:26,636 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:26,636 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-02-04 17:32:26,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:26,637 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:26,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:26,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:26,687 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:32:26,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:26,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:32:26,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:32:26,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:32:26,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:32:26,689 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-04 17:32:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:26,729 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-04 17:32:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:32:26,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:32:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:26,730 INFO L225 Difference]: With dead ends: 37 [2018-02-04 17:32:26,730 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 17:32:26,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:32:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 17:32:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 17:32:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:32:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-04 17:32:26,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-02-04 17:32:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:26,734 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-04 17:32:26,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:32:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-04 17:32:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:32:26,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:26,735 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:26,735 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-02-04 17:32:26,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:26,735 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:26,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:26,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:26,840 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:32:26,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:26,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:32:26,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:32:26,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:32:26,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:32:26,841 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-04 17:32:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:26,930 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 17:32:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:32:26,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 17:32:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:26,930 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:32:26,930 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:32:26,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:32:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:32:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-02-04 17:32:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:32:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 17:32:26,933 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-02-04 17:32:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:26,933 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 17:32:26,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:32:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 17:32:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:32:26,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:26,934 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:26,934 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-02-04 17:32:26,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:26,934 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:26,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:26,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:26,980 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:32:26,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:26,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:32:26,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:32:26,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:32:26,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:32:26,981 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-02-04 17:32:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:27,043 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 17:32:27,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:32:27,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 17:32:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:27,044 INFO L225 Difference]: With dead ends: 40 [2018-02-04 17:32:27,044 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:32:27,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:32:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:32:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-04 17:32:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:32:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 17:32:27,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-02-04 17:32:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:27,047 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 17:32:27,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:32:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 17:32:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:32:27,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:27,048 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:27,048 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-02-04 17:32:27,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:27,048 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:27,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:27,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:27,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:27,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:27,160 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:32:27,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:27,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:32:27,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:32:27,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:32:27,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:32:27,161 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-02-04 17:32:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:27,266 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 17:32:27,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:32:27,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 17:32:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:27,267 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:32:27,267 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:32:27,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:32:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:32:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-02-04 17:32:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:32:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 17:32:27,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-02-04 17:32:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:27,269 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 17:32:27,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:32:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 17:32:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:32:27,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:27,270 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, 1, 1, 1, 1, 1] [2018-02-04 17:32:27,270 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-02-04 17:32:27,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:27,270 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:27,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:27,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:27,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:27,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:27,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:27,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:32:27,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:32:27,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:32:27,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:32:27,384 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-02-04 17:32:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:27,631 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-02-04 17:32:27,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:32:27,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-04 17:32:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:27,632 INFO L225 Difference]: With dead ends: 79 [2018-02-04 17:32:27,632 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 17:32:27,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:32:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 17:32:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-02-04 17:32:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 17:32:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 17:32:27,637 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-02-04 17:32:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:27,640 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 17:32:27,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:32:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 17:32:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:32:27,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:27,641 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, 1, 1, 1, 1, 1] [2018-02-04 17:32:27,641 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:27,641 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-02-04 17:32:27,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:27,642 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:27,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:27,642 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:27,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:27,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:27,803 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:32:27,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:27,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:27,804 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:27,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:27,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:27,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:27,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:27,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:32:27,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:32:27,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:32:27,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:27,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:27,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:27,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:32:28,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-04 17:32:28,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 17:32:28,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:28,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:28,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:28,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-02-04 17:32:28,114 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:32:28,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:32:28,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-02-04 17:32:28,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:32:28,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:32:28,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:32:28,116 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 25 states. [2018-02-04 17:32:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:28,748 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-04 17:32:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:32:28,749 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2018-02-04 17:32:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:28,751 INFO L225 Difference]: With dead ends: 78 [2018-02-04 17:32:28,751 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 17:32:28,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:32:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 17:32:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-02-04 17:32:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 17:32:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-04 17:32:28,757 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-02-04 17:32:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:28,758 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-04 17:32:28,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:32:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-04 17:32:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:32:28,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:28,758 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] [2018-02-04 17:32:28,759 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-02-04 17:32:28,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:28,760 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:28,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:28,761 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:28,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:28,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:28,775 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:28,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:28,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:28,776 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:28,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:28,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:28,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:28,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:32:28,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:28,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:32:28,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:28,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:28,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:32:28,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:32:28,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:32:28,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:32:28,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 17:32:28,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 17:32:28,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:32:28,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:32:28,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-02-04 17:32:28,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 17:32:28,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 17:32:28,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 17:32:28,984 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:28,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:28,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:28,992 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:54 [2018-02-04 17:32:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:29,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:29,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:32:29,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:32:29,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:32:29,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:32:29,088 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 16 states. [2018-02-04 17:32:29,427 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-02-04 17:32:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:29,774 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-02-04 17:32:29,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:32:29,774 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-02-04 17:32:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:29,775 INFO L225 Difference]: With dead ends: 100 [2018-02-04 17:32:29,775 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 17:32:29,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:32:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 17:32:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-04 17:32:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 17:32:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2018-02-04 17:32:29,781 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 28 [2018-02-04 17:32:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:29,781 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2018-02-04 17:32:29,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:32:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2018-02-04 17:32:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:32:29,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:29,783 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:29,783 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1759144044, now seen corresponding path program 1 times [2018-02-04 17:32:29,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:29,783 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:29,784 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:29,784 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:29,784 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:29,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:29,801 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:29,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:29,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:29,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:29,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:29,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:29,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-04 17:32:29,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-02-04 17:32:29,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:29,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:29,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:32:29,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:32:29,917 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |c_main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0))))) is different from true [2018-02-04 17:32:29,923 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= (store (store (store .cse0 |main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0) |main_#t~malloc7.base| 0) |c_#valid|)))) is different from true [2018-02-04 17:32:29,929 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:32:29,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:29,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:32:29,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:32:29,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:32:29,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:32:29,932 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 8 states. [2018-02-04 17:32:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:29,998 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-04 17:32:29,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:32:29,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 17:32:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:29,999 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:32:29,999 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:32:30,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-02-04 17:32:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:32:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 17:32:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 17:32:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-04 17:32:30,006 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2018-02-04 17:32:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:30,006 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-04 17:32:30,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:32:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-04 17:32:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:32:30,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:30,007 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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:32:30,007 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1832996809, now seen corresponding path program 2 times [2018-02-04 17:32:30,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:30,008 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:30,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:30,008 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:30,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:30,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:30,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:30,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:30,248 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:32:30,279 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:32:30,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:30,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:30,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:30,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:30,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:30,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:32:30,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:32:30,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:32:30,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:30,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:30,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:30,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:32:30,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 17:32:30,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:32:30,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:30,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:30,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:30,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-02-04 17:32:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:30,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:32:30,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-02-04 17:32:30,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:32:30,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:32:30,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:32:30,487 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 27 states. [2018-02-04 17:32:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:31,076 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2018-02-04 17:32:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:32:31,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2018-02-04 17:32:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:31,077 INFO L225 Difference]: With dead ends: 115 [2018-02-04 17:32:31,078 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 17:32:31,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:32:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 17:32:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2018-02-04 17:32:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 17:32:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-02-04 17:32:31,082 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 32 [2018-02-04 17:32:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:31,082 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-02-04 17:32:31,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:32:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-02-04 17:32:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:32:31,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:31,083 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:31,083 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1916750925, now seen corresponding path program 2 times [2018-02-04 17:32:31,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:31,084 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:31,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:31,084 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:31,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:31,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:31,104 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:31,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:31,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:31,104 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:32:31,132 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:32:31,132 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:31,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:31,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:31,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:31,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:32:31,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:31,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:32:31,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:31,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:31,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:32:31,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:32:31,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:32:31,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:32:31,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-02-04 17:32:31,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 17:32:31,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:32:31,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:32:31,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 17:32:31,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-02-04 17:32:31,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 17:32:31,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:31,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-04 17:32:31,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:31,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:31,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:31,416 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-02-04 17:32:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:31,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:31,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 17:32:31,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:32:31,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:32:31,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:32:31,552 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 20 states. [2018-02-04 17:32:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:32,242 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-04 17:32:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:32:32,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-02-04 17:32:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:32,243 INFO L225 Difference]: With dead ends: 126 [2018-02-04 17:32:32,243 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 17:32:32,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:32:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 17:32:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-02-04 17:32:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 17:32:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-04 17:32:32,245 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 37 [2018-02-04 17:32:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:32,246 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-04 17:32:32,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:32:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-04 17:32:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:32:32,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:32,246 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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:32:32,246 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash -685943431, now seen corresponding path program 3 times [2018-02-04 17:32:32,247 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:32,247 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:32,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:32,247 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:32,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:32,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:32:32,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:32,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:32,426 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:32:32,458 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:32:32,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:32,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:32,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:32,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:32,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:32,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:32:32,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:32:32,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:32:32,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:32,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:32,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:32,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:32:32,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 17:32:32,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-04 17:32:32,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:32,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:32,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:32,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-02-04 17:32:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:32:32,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:32:32,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-02-04 17:32:32,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:32:32,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:32:32,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:32:32,604 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 17 states. [2018-02-04 17:32:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:32,924 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 17:32:32,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:32:32,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-02-04 17:32:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:32,924 INFO L225 Difference]: With dead ends: 121 [2018-02-04 17:32:32,925 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 17:32:32,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:32:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 17:32:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2018-02-04 17:32:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 17:32:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-02-04 17:32:32,928 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 37 [2018-02-04 17:32:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:32,928 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-02-04 17:32:32,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:32:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-02-04 17:32:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 17:32:32,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:32,929 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:32,929 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:32:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1271271661, now seen corresponding path program 3 times [2018-02-04 17:32:32,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:32,929 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:32,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:32,929 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:32,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:32,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:32,951 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:32,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:32,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:32,952 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:32:32,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:32:32,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:32,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:32,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:32,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:33,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:32:33,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:33,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:33,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:32:33,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:32:33,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:32:33,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:32:33,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:32:33,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:32:33,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-04 17:32:33,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:32:33,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:32:33,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-02-04 17:32:33,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-02-04 17:32:33,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 17:32:33,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:33,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-04 17:32:33,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:33,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:33,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:33,198 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-04 17:32:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 17:32:33,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:33,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:32:33,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:32:33,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:32:33,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:32:33,316 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 16 states. [2018-02-04 17:32:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:33,818 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 17:32:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:32:33,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 17:32:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:33,818 INFO L225 Difference]: With dead ends: 93 [2018-02-04 17:32:33,818 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:32:33,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:32:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:32:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:32:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:32:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:32:33,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-02-04 17:32:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:33,819 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:32:33,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:32:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:32:33,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:32:33,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:32:33 BoogieIcfgContainer [2018-02-04 17:32:33,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:32:33,823 INFO L168 Benchmark]: Toolchain (without parser) took 8393.84 ms. Allocated memory was 406.3 MB in the beginning and 738.7 MB in the end (delta: 332.4 MB). Free memory was 361.5 MB in the beginning and 457.6 MB in the end (delta: -96.1 MB). Peak memory consumption was 236.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:33,824 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 406.3 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:32:33,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.88 ms. Allocated memory is still 406.3 MB. Free memory was 360.1 MB in the beginning and 349.5 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:32:33,824 INFO L168 Benchmark]: Boogie Preprocessor took 26.89 ms. Allocated memory is still 406.3 MB. Free memory was 349.5 MB in the beginning and 348.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:33,824 INFO L168 Benchmark]: RCFGBuilder took 205.20 ms. Allocated memory is still 406.3 MB. Free memory was 348.2 MB in the beginning and 329.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:33,824 INFO L168 Benchmark]: TraceAbstraction took 8011.55 ms. Allocated memory was 406.3 MB in the beginning and 738.7 MB in the end (delta: 332.4 MB). Free memory was 328.3 MB in the beginning and 457.6 MB in the end (delta: -129.3 MB). Peak memory consumption was 203.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:33,825 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.14 ms. Allocated memory is still 406.3 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.88 ms. Allocated memory is still 406.3 MB. Free memory was 360.1 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.89 ms. Allocated memory is still 406.3 MB. Free memory was 349.5 MB in the beginning and 348.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 205.20 ms. Allocated memory is still 406.3 MB. Free memory was 348.2 MB in the beginning and 329.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8011.55 ms. Allocated memory was 406.3 MB in the beginning and 738.7 MB in the end (delta: 332.4 MB). Free memory was 328.3 MB in the beginning and 457.6 MB in the end (delta: -129.3 MB). Peak memory consumption was 203.1 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: 554]: 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 4 procedures, 45 locations, 9 error locations. SAFE Result, 7.9s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 787 SDslu, 2414 SDs, 0 SdLazy, 2644 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 174 SyntacticMatches, 10 SemanticMatches, 272 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=14, 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, 16 MinimizatonAttempts, 100 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 479 ConstructedInterpolants, 64 QuantifiedInterpolants, 188212 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1288 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 33/120 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/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-32-33-829.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-32-33-829.csv Received shutdown request...