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/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 21:11:27,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:11:27,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:11:27,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:11:27,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:11:27,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:11:27,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:11:27,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:11:27,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:11:27,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:11:27,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:11:27,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:11:27,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:11:27,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:11:27,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:11:27,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:11:27,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:11:27,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:11:27,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:11:27,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:11:27,991 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:11:27,991 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:11:27,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:11:27,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:11:27,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:11:27,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:11:27,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:11:27,994 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:11:27,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:11:27,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:11:27,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:11:27,995 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 21:11:28,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:11:28,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:11:28,007 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:11:28,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:11:28,007 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:11:28,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:11:28,008 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:11:28,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:11:28,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:11:28,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:11:28,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:11:28,009 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:11:28,009 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:11:28,009 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:11:28,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:11:28,009 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:11:28,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:11:28,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:11:28,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:11:28,010 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:11:28,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:11:28,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:11:28,010 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:11:28,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:11:28,011 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:11:28,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:11:28,051 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:11:28,055 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:11:28,056 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:11:28,056 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:11:28,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-02-02 21:11:28,151 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:11:28,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:11:28,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:11:28,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:11:28,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:11:28,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c392e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28, skipping insertion in model container [2018-02-02 21:11:28,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,180 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:11:28,195 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:11:28,282 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:11:28,290 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:11:28,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28 WrapperNode [2018-02-02 21:11:28,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:11:28,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:11:28,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:11:28,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:11:28,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... [2018-02-02 21:11:28,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:11:28,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:11:28,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:11:28,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:11:28,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:11:28,350 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:11:28,350 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:11:28,350 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 21:11:28,350 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:11:28,350 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 21:11:28,350 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:11:28,350 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 21:11:28,351 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:11:28,351 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:11:28,351 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:11:28,440 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:11:28,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:11:28 BoogieIcfgContainer [2018-02-02 21:11:28,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:11:28,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:11:28,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:11:28,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:11:28,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:11:28" (1/3) ... [2018-02-02 21:11:28,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb498f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:11:28, skipping insertion in model container [2018-02-02 21:11:28,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:28" (2/3) ... [2018-02-02 21:11:28,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb498f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:11:28, skipping insertion in model container [2018-02-02 21:11:28,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:11:28" (3/3) ... [2018-02-02 21:11:28,445 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-02-02 21:11:28,450 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:11:28,455 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-02-02 21:11:28,477 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:11:28,477 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:11:28,477 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:11:28,477 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:11:28,477 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:11:28,477 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:11:28,477 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:11:28,477 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:11:28,478 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:11:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-02-02 21:11:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 21:11:28,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:28,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:28,492 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1213833872, now seen corresponding path program 1 times [2018-02-02 21:11:28,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:28,496 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:28,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:28,527 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:28,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:28,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:11:28,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:11:28,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 21:11:28,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:11:28,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:11:28,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:11:28,650 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-02-02 21:11:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:28,771 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-02 21:11:28,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:11:28,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 21:11:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:28,777 INFO L225 Difference]: With dead ends: 44 [2018-02-02 21:11:28,777 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 21:11:28,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:11:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 21:11:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 21:11:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 21:11:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 21:11:28,841 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2018-02-02 21:11:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:28,842 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 21:11:28,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:11:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 21:11:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 21:11:28,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:28,842 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:28,842 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -863334142, now seen corresponding path program 1 times [2018-02-02 21:11:28,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:28,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:28,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:28,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:28,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:28,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 21:11:28,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:11:28,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:11:28,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:11:28,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:11:28,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:11:28,888 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-02-02 21:11:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:28,914 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-02 21:11:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:11:28,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 21:11:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:28,914 INFO L225 Difference]: With dead ends: 30 [2018-02-02 21:11:28,915 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 21:11:28,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:11:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 21:11:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-02-02 21:11:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 21:11:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-02 21:11:28,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2018-02-02 21:11:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:28,919 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-02 21:11:28,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:11:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-02 21:11:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 21:11:28,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:28,920 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:28,920 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1135364244, now seen corresponding path program 1 times [2018-02-02 21:11:28,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:28,921 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:28,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:28,921 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:28,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:28,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 21:11:28,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:28,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:28,978 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:28,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 21:11:29,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:29,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-02 21:11:29,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:11:29,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:11:29,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:11:29,013 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-02-02 21:11:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:29,047 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-02 21:11:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:11:29,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 21:11:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:29,048 INFO L225 Difference]: With dead ends: 44 [2018-02-02 21:11:29,048 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 21:11:29,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:11:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 21:11:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-02-02 21:11:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 21:11:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-02-02 21:11:29,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-02-02 21:11:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:29,050 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-02-02 21:11:29,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:11:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-02-02 21:11:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 21:11:29,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:29,051 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:29,051 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1230203493, now seen corresponding path program 2 times [2018-02-02 21:11:29,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:29,051 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:29,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,052 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:29,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:29,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 21:11:29,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:29,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:29,106 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:11:29,118 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:11:29,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:29,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 21:11:29,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:29,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-02 21:11:29,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:11:29,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:11:29,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:11:29,129 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-02-02 21:11:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:29,166 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-02 21:11:29,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:11:29,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 21:11:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:29,167 INFO L225 Difference]: With dead ends: 53 [2018-02-02 21:11:29,167 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 21:11:29,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:11:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 21:11:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-02-02 21:11:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 21:11:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-02 21:11:29,170 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2018-02-02 21:11:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:29,170 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-02 21:11:29,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:11:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-02 21:11:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 21:11:29,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:29,171 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:29,171 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 417265886, now seen corresponding path program 3 times [2018-02-02 21:11:29,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:29,171 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:29,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,172 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:29,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:29,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 21:11:29,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:29,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:29,220 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:11:29,238 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 21:11:29,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:29,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 21:11:29,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:29,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-02-02 21:11:29,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:11:29,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:11:29,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:11:29,256 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-02-02 21:11:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:29,353 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-02 21:11:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:11:29,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-02-02 21:11:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:29,354 INFO L225 Difference]: With dead ends: 62 [2018-02-02 21:11:29,354 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 21:11:29,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:11:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 21:11:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-02-02 21:11:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 21:11:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-02 21:11:29,359 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 36 [2018-02-02 21:11:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:29,359 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-02 21:11:29,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:11:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-02 21:11:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 21:11:29,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:29,361 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:29,361 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash 576961419, now seen corresponding path program 4 times [2018-02-02 21:11:29,361 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:29,361 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:29,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,362 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:29,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:29,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 21:11:29,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:29,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:29,433 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:11:29,444 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:11:29,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:29,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 21:11:29,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:29,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-02-02 21:11:29,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:11:29,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:11:29,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:11:29,479 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 12 states. [2018-02-02 21:11:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:29,570 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-02-02 21:11:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:11:29,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-02 21:11:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:29,571 INFO L225 Difference]: With dead ends: 71 [2018-02-02 21:11:29,571 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 21:11:29,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:11:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 21:11:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-02-02 21:11:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 21:11:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-02 21:11:29,576 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2018-02-02 21:11:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:29,576 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-02 21:11:29,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:11:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-02 21:11:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 21:11:29,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:29,577 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:29,578 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash -922733168, now seen corresponding path program 5 times [2018-02-02 21:11:29,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:29,578 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:29,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,579 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:29,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:29,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 21:11:29,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:29,646 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:29,647 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:11:29,704 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-02 21:11:29,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:29,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 21:11:29,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:29,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-02-02 21:11:29,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:11:29,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:11:29,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:11:29,719 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 9 states. [2018-02-02 21:11:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:29,813 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-02-02 21:11:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:11:29,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-02 21:11:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:29,817 INFO L225 Difference]: With dead ends: 80 [2018-02-02 21:11:29,817 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 21:11:29,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:11:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 21:11:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2018-02-02 21:11:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 21:11:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-02 21:11:29,821 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-02-02 21:11:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:29,822 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-02 21:11:29,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:11:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-02 21:11:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 21:11:29,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:29,823 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:29,823 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 582923081, now seen corresponding path program 6 times [2018-02-02 21:11:29,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:29,823 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:29,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,824 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:29,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:29,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 21:11:29,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:29,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:29,886 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:11:29,903 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-02 21:11:29,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:29,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-02 21:11:29,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:29,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2018-02-02 21:11:29,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:11:29,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:11:29,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:11:29,925 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2018-02-02 21:11:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:30,024 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-02-02 21:11:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:11:30,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-02-02 21:11:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:30,025 INFO L225 Difference]: With dead ends: 89 [2018-02-02 21:11:30,025 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 21:11:30,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:11:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 21:11:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-02-02 21:11:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 21:11:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-02-02 21:11:30,030 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2018-02-02 21:11:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:30,030 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-02-02 21:11:30,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:11:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-02-02 21:11:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 21:11:30,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:30,031 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:30,031 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash -119208768, now seen corresponding path program 7 times [2018-02-02 21:11:30,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:30,032 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:30,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,032 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:30,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:30,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 21:11:30,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:30,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:30,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:30,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 21:11:30,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:30,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-02-02 21:11:30,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:11:30,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:11:30,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:11:30,138 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2018-02-02 21:11:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:30,223 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-02-02 21:11:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:11:30,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-02 21:11:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:30,224 INFO L225 Difference]: With dead ends: 98 [2018-02-02 21:11:30,224 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 21:11:30,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:11:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 21:11:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-02-02 21:11:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 21:11:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-02-02 21:11:30,229 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2018-02-02 21:11:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:30,230 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-02-02 21:11:30,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:11:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-02-02 21:11:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 21:11:30,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:30,231 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:30,231 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1755339687, now seen corresponding path program 8 times [2018-02-02 21:11:30,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:30,231 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:30,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:30,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:30,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 21:11:30,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:30,315 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:30,315 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:11:30,325 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:11:30,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:30,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 21:11:30,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:30,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-02-02 21:11:30,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:11:30,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:11:30,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:11:30,340 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 12 states. [2018-02-02 21:11:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:30,406 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-02-02 21:11:30,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:11:30,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-02-02 21:11:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:30,407 INFO L225 Difference]: With dead ends: 107 [2018-02-02 21:11:30,407 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 21:11:30,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:11:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 21:11:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 76. [2018-02-02 21:11:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 21:11:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-02 21:11:30,412 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2018-02-02 21:11:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:30,412 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-02 21:11:30,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:11:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-02 21:11:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 21:11:30,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:30,413 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:30,413 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1266149134, now seen corresponding path program 9 times [2018-02-02 21:11:30,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:30,413 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:30,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,413 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:30,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:30,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 21:11:30,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:30,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:30,525 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:11:30,537 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-02 21:11:30,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:30,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 21:11:30,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:30,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 15 [2018-02-02 21:11:30,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:11:30,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:11:30,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=115, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:11:30,563 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 15 states. [2018-02-02 21:11:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:30,716 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-02 21:11:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:11:30,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-02-02 21:11:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:30,717 INFO L225 Difference]: With dead ends: 116 [2018-02-02 21:11:30,718 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 21:11:30,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=215, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:11:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 21:11:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2018-02-02 21:11:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 21:11:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-02 21:11:30,722 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 75 [2018-02-02 21:11:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:30,723 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-02 21:11:30,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:11:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-02 21:11:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 21:11:30,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:30,724 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:30,724 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash 449763885, now seen corresponding path program 10 times [2018-02-02 21:11:30,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:30,725 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:30,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,726 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:30,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:30,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-02-02 21:11:30,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:30,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:30,805 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:11:30,815 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:11:30,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:30,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 21:11:30,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:30,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2018-02-02 21:11:30,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 21:11:30,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 21:11:30,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=252, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:11:30,883 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 21 states. [2018-02-02 21:11:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:31,018 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-02 21:11:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:11:31,018 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-02-02 21:11:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:31,019 INFO L225 Difference]: With dead ends: 125 [2018-02-02 21:11:31,019 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 21:11:31,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=252, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:11:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 21:11:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2018-02-02 21:11:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 21:11:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-02-02 21:11:31,021 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-02-02 21:11:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:31,021 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-02-02 21:11:31,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 21:11:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-02-02 21:11:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 21:11:31,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:31,022 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:31,024 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2072720996, now seen corresponding path program 11 times [2018-02-02 21:11:31,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:31,024 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:31,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:31,025 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:31,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:31,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-02 21:11:31,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:31,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:31,148 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:11:31,213 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-02-02 21:11:31,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:31,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-02 21:11:31,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:31,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-02-02 21:11:31,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:11:31,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:11:31,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:11:31,232 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 15 states. [2018-02-02 21:11:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:31,328 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-02-02 21:11:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:11:31,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-02-02 21:11:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:31,328 INFO L225 Difference]: With dead ends: 134 [2018-02-02 21:11:31,329 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 21:11:31,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:11:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 21:11:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2018-02-02 21:11:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 21:11:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-02-02 21:11:31,333 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 93 [2018-02-02 21:11:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:31,333 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-02-02 21:11:31,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:11:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-02-02 21:11:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 21:11:31,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:31,335 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:31,335 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1681309123, now seen corresponding path program 12 times [2018-02-02 21:11:31,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:31,335 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:31,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:31,336 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:31,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:31,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-02 21:11:31,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:31,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:31,462 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:11:31,482 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-02-02 21:11:31,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:31,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-02 21:11:31,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:31,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 18 [2018-02-02 21:11:31,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:11:31,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:11:31,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:11:31,513 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 18 states. [2018-02-02 21:11:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:31,698 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-02-02 21:11:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:11:31,698 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2018-02-02 21:11:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:31,699 INFO L225 Difference]: With dead ends: 143 [2018-02-02 21:11:31,699 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 21:11:31,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-02 21:11:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 21:11:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2018-02-02 21:11:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 21:11:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-02-02 21:11:31,702 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 97 [2018-02-02 21:11:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:31,703 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-02-02 21:11:31,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:11:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-02-02 21:11:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 21:11:31,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:31,704 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:31,704 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash 572677080, now seen corresponding path program 13 times [2018-02-02 21:11:31,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:31,704 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:31,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:31,705 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:31,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:31,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-02-02 21:11:31,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:31,864 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:31,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:31,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-02-02 21:11:31,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:31,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-02 21:11:31,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:11:31,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:11:31,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:11:31,892 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 17 states. [2018-02-02 21:11:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:32,012 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-02-02 21:11:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:11:32,013 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2018-02-02 21:11:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:32,013 INFO L225 Difference]: With dead ends: 152 [2018-02-02 21:11:32,013 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 21:11:32,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:11:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 21:11:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2018-02-02 21:11:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 21:11:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-02 21:11:32,016 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-02-02 21:11:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:32,017 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-02 21:11:32,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:11:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-02 21:11:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 21:11:32,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:32,018 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:32,018 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1895210769, now seen corresponding path program 14 times [2018-02-02 21:11:32,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:32,018 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:32,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:32,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:32,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:32,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-02-02 21:11:32,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:32,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:32,143 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:11:32,150 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:11:32,150 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:32,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-02 21:11:32,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:32,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-02-02 21:11:32,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 21:11:32,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 21:11:32,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=423, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:11:32,228 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 27 states. [2018-02-02 21:11:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:32,581 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-02-02 21:11:32,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:11:32,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-02-02 21:11:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:32,582 INFO L225 Difference]: With dead ends: 161 [2018-02-02 21:11:32,582 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 21:11:32,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=279, Invalid=423, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:11:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 21:11:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-02-02 21:11:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 21:11:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-02-02 21:11:32,585 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 110 [2018-02-02 21:11:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:32,585 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-02-02 21:11:32,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 21:11:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-02-02 21:11:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-02 21:11:32,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:32,586 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:32,586 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -394157960, now seen corresponding path program 15 times [2018-02-02 21:11:32,586 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:32,586 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:32,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:32,586 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:32,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:32,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-02-02 21:11:32,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:32,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:32,807 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:11:32,825 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-02 21:11:32,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:32,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-02 21:11:32,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:32,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 21 [2018-02-02 21:11:32,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 21:11:32,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 21:11:32,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:11:32,863 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2018-02-02 21:11:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:33,095 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-02-02 21:11:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:11:33,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-02-02 21:11:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:33,096 INFO L225 Difference]: With dead ends: 170 [2018-02-02 21:11:33,096 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 21:11:33,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=372, Invalid=498, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:11:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 21:11:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 129. [2018-02-02 21:11:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 21:11:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-02-02 21:11:33,098 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 119 [2018-02-02 21:11:33,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:33,098 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-02-02 21:11:33,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 21:11:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-02-02 21:11:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 21:11:33,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:33,100 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:33,100 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:33,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1009410435, now seen corresponding path program 16 times [2018-02-02 21:11:33,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:33,100 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:33,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:33,101 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:33,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:33,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-02-02 21:11:33,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:33,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:33,236 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:11:33,243 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:11:33,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:33,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-02-02 21:11:33,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:33,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-02-02 21:11:33,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:11:33,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:11:33,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:11:33,269 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 20 states. [2018-02-02 21:11:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:33,394 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-02-02 21:11:33,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:11:33,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-02-02 21:11:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:33,395 INFO L225 Difference]: With dead ends: 179 [2018-02-02 21:11:33,395 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 21:11:33,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:11:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 21:11:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 133. [2018-02-02 21:11:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 21:11:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-02-02 21:11:33,397 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2018-02-02 21:11:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:33,397 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-02-02 21:11:33,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:11:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-02-02 21:11:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 21:11:33,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:33,398 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:33,398 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1948615676, now seen corresponding path program 17 times [2018-02-02 21:11:33,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:33,398 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:33,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:33,399 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:33,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:33,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-02-02 21:11:33,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:33,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:33,564 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:11:33,730 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-02-02 21:11:33,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:33,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-02 21:11:33,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:33,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 32 [2018-02-02 21:11:33,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 21:11:33,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 21:11:33,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=606, Unknown=0, NotChecked=0, Total=992 [2018-02-02 21:11:33,848 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 32 states. [2018-02-02 21:11:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:34,322 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-02-02 21:11:34,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 21:11:34,322 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 132 [2018-02-02 21:11:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:34,323 INFO L225 Difference]: With dead ends: 188 [2018-02-02 21:11:34,323 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 21:11:34,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=386, Invalid=606, Unknown=0, NotChecked=0, Total=992 [2018-02-02 21:11:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 21:11:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 142. [2018-02-02 21:11:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 21:11:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-02-02 21:11:34,326 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 132 [2018-02-02 21:11:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:34,326 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-02-02 21:11:34,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 21:11:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-02-02 21:11:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 21:11:34,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:34,327 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:34,327 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1636065069, now seen corresponding path program 18 times [2018-02-02 21:11:34,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:34,328 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:34,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:34,329 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:34,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:34,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-02-02 21:11:34,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:34,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:34,526 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:11:34,569 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-02-02 21:11:34,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:34,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-02 21:11:34,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:34,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 24 [2018-02-02 21:11:34,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 21:11:34,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 21:11:34,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:11:34,608 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 24 states. [2018-02-02 21:11:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:34,902 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-02-02 21:11:34,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:11:34,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2018-02-02 21:11:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:34,903 INFO L225 Difference]: With dead ends: 197 [2018-02-02 21:11:34,903 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 21:11:34,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=507, Invalid=683, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:11:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 21:11:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 151. [2018-02-02 21:11:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 21:11:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-02-02 21:11:34,906 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2018-02-02 21:11:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:34,907 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-02-02 21:11:34,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 21:11:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-02-02 21:11:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-02 21:11:34,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:34,907 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:34,908 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2089739474, now seen corresponding path program 19 times [2018-02-02 21:11:34,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:34,908 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:34,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:34,909 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:34,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:34,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-02 21:11:35,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:35,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:35,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:35,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-02 21:11:35,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:35,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-02 21:11:35,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:11:35,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:11:35,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:11:35,176 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 23 states. [2018-02-02 21:11:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:35,270 INFO L93 Difference]: Finished difference Result 206 states and 215 transitions. [2018-02-02 21:11:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:11:35,270 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 150 [2018-02-02 21:11:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:35,271 INFO L225 Difference]: With dead ends: 206 [2018-02-02 21:11:35,271 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 21:11:35,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:11:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 21:11:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 155. [2018-02-02 21:11:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 21:11:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-02-02 21:11:35,274 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-02-02 21:11:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:35,274 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-02-02 21:11:35,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:11:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-02-02 21:11:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 21:11:35,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:35,275 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:35,275 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1693986023, now seen corresponding path program 20 times [2018-02-02 21:11:35,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:35,276 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:35,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:35,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:35,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:35,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-02 21:11:35,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:35,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:35,518 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:11:35,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:11:35,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:35,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-02 21:11:35,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:35,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-02 21:11:35,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 21:11:35,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 21:11:35,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:11:35,556 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 24 states. [2018-02-02 21:11:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:35,725 INFO L93 Difference]: Finished difference Result 215 states and 225 transitions. [2018-02-02 21:11:35,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 21:11:35,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2018-02-02 21:11:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:35,727 INFO L225 Difference]: With dead ends: 215 [2018-02-02 21:11:35,727 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 21:11:35,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:11:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 21:11:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 159. [2018-02-02 21:11:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 21:11:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-02-02 21:11:35,731 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-02-02 21:11:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:35,732 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-02-02 21:11:35,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 21:11:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-02-02 21:11:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-02 21:11:35,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:35,733 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:35,733 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash 616413728, now seen corresponding path program 21 times [2018-02-02 21:11:35,733 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:35,733 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:35,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:35,734 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:35,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:35,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-02 21:11:35,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:35,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:35,965 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:11:35,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-02 21:11:35,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:35,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-02 21:11:36,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:36,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15] total 27 [2018-02-02 21:11:36,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 21:11:36,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 21:11:36,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:11:36,035 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 27 states. [2018-02-02 21:11:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:36,274 INFO L93 Difference]: Finished difference Result 224 states and 234 transitions. [2018-02-02 21:11:36,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 21:11:36,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 158 [2018-02-02 21:11:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:36,275 INFO L225 Difference]: With dead ends: 224 [2018-02-02 21:11:36,275 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 21:11:36,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=639, Invalid=843, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 21:11:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 21:11:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 168. [2018-02-02 21:11:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 21:11:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-02-02 21:11:36,278 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 158 [2018-02-02 21:11:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:36,278 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-02-02 21:11:36,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 21:11:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-02-02 21:11:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 21:11:36,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:36,278 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:36,278 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -294777655, now seen corresponding path program 22 times [2018-02-02 21:11:36,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:36,279 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:36,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:36,279 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:36,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:36,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-02-02 21:11:36,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:36,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:36,508 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:11:36,518 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:11:36,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:36,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-02 21:11:36,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:36,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15] total 40 [2018-02-02 21:11:36,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 21:11:36,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 21:11:36,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=962, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 21:11:36,629 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 40 states. [2018-02-02 21:11:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:37,178 INFO L93 Difference]: Finished difference Result 233 states and 243 transitions. [2018-02-02 21:11:37,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 21:11:37,178 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 167 [2018-02-02 21:11:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:37,179 INFO L225 Difference]: With dead ends: 233 [2018-02-02 21:11:37,180 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 21:11:37,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=598, Invalid=962, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 21:11:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 21:11:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 177. [2018-02-02 21:11:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 21:11:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-02-02 21:11:37,183 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 167 [2018-02-02 21:11:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:37,183 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-02-02 21:11:37,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 21:11:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-02-02 21:11:37,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-02-02 21:11:37,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:37,184 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:37,185 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1773352494, now seen corresponding path program 23 times [2018-02-02 21:11:37,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:37,185 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:37,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:37,186 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:37,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:37,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-02 21:11:37,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:37,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:37,532 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:11:37,978 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-02-02 21:11:37,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:37,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-02 21:11:38,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:38,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-02-02 21:11:38,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 21:11:38,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 21:11:38,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:11:38,022 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 27 states. [2018-02-02 21:11:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:38,224 INFO L93 Difference]: Finished difference Result 242 states and 253 transitions. [2018-02-02 21:11:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 21:11:38,225 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 176 [2018-02-02 21:11:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:38,225 INFO L225 Difference]: With dead ends: 242 [2018-02-02 21:11:38,225 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 21:11:38,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:11:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 21:11:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 181. [2018-02-02 21:11:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 21:11:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-02-02 21:11:38,228 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2018-02-02 21:11:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:38,228 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-02-02 21:11:38,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 21:11:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-02-02 21:11:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-02 21:11:38,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:38,230 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:38,230 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash -624576949, now seen corresponding path program 24 times [2018-02-02 21:11:38,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:38,230 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:38,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:38,231 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:38,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:38,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-02 21:11:38,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:38,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:38,521 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:11:38,579 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-02-02 21:11:38,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:38,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-02 21:11:38,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:38,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 30 [2018-02-02 21:11:38,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 21:11:38,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 21:11:38,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=463, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:11:38,637 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 30 states. [2018-02-02 21:11:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:39,021 INFO L93 Difference]: Finished difference Result 251 states and 262 transitions. [2018-02-02 21:11:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:11:39,021 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 180 [2018-02-02 21:11:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:39,023 INFO L225 Difference]: With dead ends: 251 [2018-02-02 21:11:39,023 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 21:11:39,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=813, Invalid=1079, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:11:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 21:11:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 190. [2018-02-02 21:11:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 21:11:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-02-02 21:11:39,030 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 180 [2018-02-02 21:11:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:39,031 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-02-02 21:11:39,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 21:11:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-02-02 21:11:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-02 21:11:39,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:39,032 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:39,032 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1687700418, now seen corresponding path program 25 times [2018-02-02 21:11:39,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:39,032 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:39,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:39,033 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:39,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:39,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1907 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-02-02 21:11:39,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:39,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:39,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:39,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1907 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-02-02 21:11:39,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:39,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-02 21:11:39,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:11:39,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:11:39,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:11:39,465 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 29 states. [2018-02-02 21:11:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:39,649 INFO L93 Difference]: Finished difference Result 260 states and 272 transitions. [2018-02-02 21:11:39,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:11:39,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 189 [2018-02-02 21:11:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:39,650 INFO L225 Difference]: With dead ends: 260 [2018-02-02 21:11:39,650 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 21:11:39,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:11:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 21:11:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 194. [2018-02-02 21:11:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 21:11:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-02-02 21:11:39,653 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 189 [2018-02-02 21:11:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:39,653 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-02-02 21:11:39,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:11:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-02-02 21:11:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-02 21:11:39,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:39,654 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:39,654 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1851614107, now seen corresponding path program 26 times [2018-02-02 21:11:39,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:39,654 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:39,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:39,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:39,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:39,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-02-02 21:11:40,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:40,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:40,011 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:11:40,023 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:11:40,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:40,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-02-02 21:11:40,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:40,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 35 [2018-02-02 21:11:40,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:11:40,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:11:40,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=670, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:11:40,095 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 35 states. [2018-02-02 21:11:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:40,506 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2018-02-02 21:11:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 21:11:40,507 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 193 [2018-02-02 21:11:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:40,508 INFO L225 Difference]: With dead ends: 269 [2018-02-02 21:11:40,508 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 21:11:40,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=979, Invalid=1471, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 21:11:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 21:11:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 203. [2018-02-02 21:11:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 21:11:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-02-02 21:11:40,512 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 193 [2018-02-02 21:11:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:40,512 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-02-02 21:11:40,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:11:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-02-02 21:11:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 21:11:40,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:40,513 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:40,513 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash -323819914, now seen corresponding path program 27 times [2018-02-02 21:11:40,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:40,514 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:40,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:40,514 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:40,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:40,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-02-02 21:11:40,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:40,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:40,938 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:11:40,965 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-02-02 21:11:40,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:40,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-02 21:11:41,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:41,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19] total 33 [2018-02-02 21:11:41,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 21:11:41,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 21:11:41,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=560, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 21:11:41,022 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 33 states. [2018-02-02 21:11:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:41,396 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2018-02-02 21:11:41,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 21:11:41,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 202 [2018-02-02 21:11:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:41,398 INFO L225 Difference]: With dead ends: 278 [2018-02-02 21:11:41,398 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 21:11:41,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1008, Invalid=1344, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:11:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 21:11:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 212. [2018-02-02 21:11:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 21:11:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-02-02 21:11:41,402 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 202 [2018-02-02 21:11:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:41,402 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-02-02 21:11:41,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 21:11:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-02-02 21:11:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-02-02 21:11:41,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:41,403 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:41,403 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:41,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2142656589, now seen corresponding path program 28 times [2018-02-02 21:11:41,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:41,404 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:41,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:41,404 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:41,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:41,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-02-02 21:11:41,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:41,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:41,919 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:11:41,931 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:11:41,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:41,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-02-02 21:11:41,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:41,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-02-02 21:11:41,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 21:11:41,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 21:11:41,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 21:11:41,971 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 32 states. [2018-02-02 21:11:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:42,164 INFO L93 Difference]: Finished difference Result 287 states and 300 transitions. [2018-02-02 21:11:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 21:11:42,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 211 [2018-02-02 21:11:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:42,166 INFO L225 Difference]: With dead ends: 287 [2018-02-02 21:11:42,166 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 21:11:42,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 21:11:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 21:11:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 216. [2018-02-02 21:11:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 21:11:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-02-02 21:11:42,169 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 211 [2018-02-02 21:11:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:42,169 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-02-02 21:11:42,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 21:11:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-02-02 21:11:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-02-02 21:11:42,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:42,170 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:42,170 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:42,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1655365786, now seen corresponding path program 29 times [2018-02-02 21:11:42,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:42,171 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:42,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:42,171 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:42,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:42,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2514 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-02-02 21:11:42,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:42,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:42,690 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:11:43,563 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-02-02 21:11:43,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:43,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2514 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-02-02 21:11:43,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:43,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20] total 51 [2018-02-02 21:11:43,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 21:11:43,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 21:11:43,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=969, Invalid=1581, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:11:43,786 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 51 states. [2018-02-02 21:11:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:44,628 INFO L93 Difference]: Finished difference Result 296 states and 309 transitions. [2018-02-02 21:11:44,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 21:11:44,628 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 215 [2018-02-02 21:11:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:44,629 INFO L225 Difference]: With dead ends: 296 [2018-02-02 21:11:44,629 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 21:11:44,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=969, Invalid=1581, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:11:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 21:11:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 225. [2018-02-02 21:11:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 21:11:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-02-02 21:11:44,631 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 215 [2018-02-02 21:11:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:44,632 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-02-02 21:11:44,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 21:11:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-02-02 21:11:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-02-02 21:11:44,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:44,632 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:44,632 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:44,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1187546463, now seen corresponding path program 30 times [2018-02-02 21:11:44,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:44,633 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:44,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:44,633 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:44,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:44,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2723 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-02-02 21:11:45,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:45,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:45,041 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:11:45,078 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-02-02 21:11:45,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:45,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2723 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-02-02 21:11:45,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:45,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 21] total 36 [2018-02-02 21:11:45,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 21:11:45,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 21:11:45,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=666, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 21:11:45,120 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 36 states. [2018-02-02 21:11:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:45,582 INFO L93 Difference]: Finished difference Result 305 states and 318 transitions. [2018-02-02 21:11:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 21:11:45,583 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 224 [2018-02-02 21:11:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:45,583 INFO L225 Difference]: With dead ends: 305 [2018-02-02 21:11:45,584 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 21:11:45,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1224, Invalid=1638, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 21:11:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 21:11:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 234. [2018-02-02 21:11:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 21:11:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-02-02 21:11:45,587 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 224 [2018-02-02 21:11:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:45,588 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-02-02 21:11:45,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 21:11:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-02-02 21:11:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-02 21:11:45,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:45,589 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:45,589 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash -51667160, now seen corresponding path program 31 times [2018-02-02 21:11:45,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:45,590 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:45,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:45,590 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:45,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:45,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-02-02 21:11:46,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:46,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:46,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:46,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-02-02 21:11:46,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:46,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-02-02 21:11:46,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:11:46,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:11:46,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:11:46,083 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 35 states. [2018-02-02 21:11:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:46,263 INFO L93 Difference]: Finished difference Result 314 states and 328 transitions. [2018-02-02 21:11:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 21:11:46,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 233 [2018-02-02 21:11:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:46,264 INFO L225 Difference]: With dead ends: 314 [2018-02-02 21:11:46,264 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 21:11:46,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:11:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 21:11:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 238. [2018-02-02 21:11:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 21:11:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-02-02 21:11:46,268 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 233 [2018-02-02 21:11:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:46,269 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-02-02 21:11:46,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:11:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-02-02 21:11:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-02 21:11:46,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:46,270 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:46,270 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:46,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1020534991, now seen corresponding path program 32 times [2018-02-02 21:11:46,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:46,270 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:46,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:46,271 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:46,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:46,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3071 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-02-02 21:11:46,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:46,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:46,697 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:11:46,705 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:11:46,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:46,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3071 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-02-02 21:11:46,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:46,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 21] total 56 [2018-02-02 21:11:46,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 21:11:46,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 21:11:46,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=1920, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 21:11:46,930 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 56 states. [2018-02-02 21:11:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:47,867 INFO L93 Difference]: Finished difference Result 323 states and 337 transitions. [2018-02-02 21:11:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 21:11:47,868 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 237 [2018-02-02 21:11:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:47,868 INFO L225 Difference]: With dead ends: 323 [2018-02-02 21:11:47,868 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 21:11:47,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1160, Invalid=1920, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 21:11:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 21:11:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 247. [2018-02-02 21:11:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 21:11:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-02-02 21:11:47,872 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2018-02-02 21:11:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:47,872 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-02-02 21:11:47,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 21:11:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-02-02 21:11:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-02-02 21:11:47,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:47,873 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:47,873 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:47,873 INFO L82 PathProgramCache]: Analyzing trace with hash 713401036, now seen corresponding path program 33 times [2018-02-02 21:11:47,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:47,874 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:47,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:47,874 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:47,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:47,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-02-02 21:11:48,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:48,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:48,333 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:11:48,364 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-02-02 21:11:48,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:48,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-02-02 21:11:48,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:48,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 23] total 39 [2018-02-02 21:11:48,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 21:11:48,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 21:11:48,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=781, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 21:11:48,426 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 39 states. [2018-02-02 21:11:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:48,854 INFO L93 Difference]: Finished difference Result 332 states and 346 transitions. [2018-02-02 21:11:48,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 21:11:48,854 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 246 [2018-02-02 21:11:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:48,855 INFO L225 Difference]: With dead ends: 332 [2018-02-02 21:11:48,855 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 21:11:48,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1461, Invalid=1961, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:11:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 21:11:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 256. [2018-02-02 21:11:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 21:11:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-02-02 21:11:48,858 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 246 [2018-02-02 21:11:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:48,858 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-02-02 21:11:48,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 21:11:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-02-02 21:11:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-02 21:11:48,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:48,859 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:48,859 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1935314275, now seen corresponding path program 34 times [2018-02-02 21:11:48,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:48,859 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:48,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:48,860 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:48,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:48,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-02 21:11:49,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:49,340 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:49,341 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:11:49,348 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:11:49,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:49,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-02 21:11:49,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:49,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-02-02 21:11:49,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 21:11:49,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 21:11:49,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 21:11:49,402 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2018-02-02 21:11:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:49,666 INFO L93 Difference]: Finished difference Result 341 states and 356 transitions. [2018-02-02 21:11:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 21:11:49,666 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 255 [2018-02-02 21:11:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:49,667 INFO L225 Difference]: With dead ends: 341 [2018-02-02 21:11:49,667 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 21:11:49,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 21:11:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 21:11:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 260. [2018-02-02 21:11:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 21:11:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-02-02 21:11:49,669 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 255 [2018-02-02 21:11:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:49,669 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-02-02 21:11:49,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 21:11:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-02-02 21:11:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-02 21:11:49,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:49,670 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:49,670 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash -752734972, now seen corresponding path program 35 times [2018-02-02 21:11:49,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:49,671 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:49,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:49,671 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:49,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:49,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-02 21:11:50,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:50,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:50,149 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:11:52,375 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-02-02 21:11:52,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:52,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-02 21:11:52,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:52,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-02-02 21:11:52,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 21:11:52,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 21:11:52,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 21:11:52,418 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 39 states. [2018-02-02 21:11:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:52,769 INFO L93 Difference]: Finished difference Result 350 states and 366 transitions. [2018-02-02 21:11:52,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 21:11:52,770 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 259 [2018-02-02 21:11:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:52,771 INFO L225 Difference]: With dead ends: 350 [2018-02-02 21:11:52,771 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 21:11:52,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 21:11:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 21:11:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 264. [2018-02-02 21:11:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-02 21:11:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2018-02-02 21:11:52,773 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 259 [2018-02-02 21:11:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:52,773 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2018-02-02 21:11:52,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 21:11:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2018-02-02 21:11:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-02-02 21:11:52,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:52,775 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:52,775 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:52,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1101177877, now seen corresponding path program 36 times [2018-02-02 21:11:52,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:52,775 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:52,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:52,776 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:52,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:52,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3830 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-02 21:11:53,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:53,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:53,292 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:11:53,411 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-02-02 21:11:53,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:53,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3830 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-02-02 21:11:53,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:53,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 24] total 42 [2018-02-02 21:11:53,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 21:11:53,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 21:11:53,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=903, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 21:11:53,472 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 42 states. [2018-02-02 21:11:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:53,959 INFO L93 Difference]: Finished difference Result 359 states and 375 transitions. [2018-02-02 21:11:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 21:11:53,960 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 263 [2018-02-02 21:11:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:53,960 INFO L225 Difference]: With dead ends: 359 [2018-02-02 21:11:53,960 INFO L226 Difference]: Without dead ends: 359 [2018-02-02 21:11:53,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1680, Invalid=2226, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 21:11:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-02 21:11:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 273. [2018-02-02 21:11:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 21:11:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-02-02 21:11:53,963 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 263 [2018-02-02 21:11:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:53,964 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-02-02 21:11:53,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 21:11:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-02-02 21:11:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-02 21:11:53,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:53,965 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:53,965 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1190317072, now seen corresponding path program 37 times [2018-02-02 21:11:53,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:53,965 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:53,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:53,966 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:53,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:53,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4087 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-02-02 21:11:54,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:54,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:54,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:54,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4087 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-02-02 21:11:54,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:54,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-02 21:11:54,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:11:54,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:11:54,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:11:54,508 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 41 states. [2018-02-02 21:11:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:54,747 INFO L93 Difference]: Finished difference Result 368 states and 385 transitions. [2018-02-02 21:11:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 21:11:54,747 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 272 [2018-02-02 21:11:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:54,748 INFO L225 Difference]: With dead ends: 368 [2018-02-02 21:11:54,748 INFO L226 Difference]: Without dead ends: 368 [2018-02-02 21:11:54,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:11:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-02 21:11:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 277. [2018-02-02 21:11:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 21:11:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-02-02 21:11:54,751 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 272 [2018-02-02 21:11:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:54,751 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-02-02 21:11:54,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:11:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-02-02 21:11:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-02-02 21:11:54,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:54,753 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:54,753 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash -821185431, now seen corresponding path program 38 times [2018-02-02 21:11:54,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:54,753 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:54,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:54,754 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:11:54,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:54,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-02-02 21:11:55,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:55,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:55,246 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:11:55,254 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:11:55,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:55,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-02-02 21:11:55,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:55,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 25] total 46 [2018-02-02 21:11:55,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 21:11:55,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 21:11:55,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=947, Invalid=1123, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 21:11:55,347 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 46 states. [2018-02-02 21:11:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:55,873 INFO L93 Difference]: Finished difference Result 377 states and 394 transitions. [2018-02-02 21:11:55,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 21:11:55,874 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 276 [2018-02-02 21:11:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:55,874 INFO L225 Difference]: With dead ends: 377 [2018-02-02 21:11:55,875 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 21:11:55,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1890, Invalid=2666, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 21:11:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 21:11:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 286. [2018-02-02 21:11:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 21:11:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 287 transitions. [2018-02-02 21:11:55,877 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 287 transitions. Word has length 276 [2018-02-02 21:11:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:55,877 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 287 transitions. [2018-02-02 21:11:55,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 21:11:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 287 transitions. [2018-02-02 21:11:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-02 21:11:55,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:55,878 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:55,878 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1230949600, now seen corresponding path program 39 times [2018-02-02 21:11:55,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:55,878 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:55,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:55,878 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:55,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:55,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2018-02-02 21:11:56,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:56,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:56,417 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:11:56,445 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-02-02 21:11:56,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:56,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-02-02 21:11:56,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:56,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 26] total 45 [2018-02-02 21:11:56,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 21:11:56,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 21:11:56,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=944, Invalid=1036, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 21:11:56,537 INFO L87 Difference]: Start difference. First operand 286 states and 287 transitions. Second operand 45 states. [2018-02-02 21:11:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:57,042 INFO L93 Difference]: Finished difference Result 386 states and 403 transitions. [2018-02-02 21:11:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 21:11:57,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 285 [2018-02-02 21:11:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:57,043 INFO L225 Difference]: With dead ends: 386 [2018-02-02 21:11:57,043 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 21:11:57,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1956, Invalid=2600, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 21:11:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 21:11:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 295. [2018-02-02 21:11:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 21:11:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-02-02 21:11:57,046 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2018-02-02 21:11:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:57,046 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-02-02 21:11:57,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 21:11:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-02-02 21:11:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-02-02 21:11:57,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:57,047 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:57,047 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2083529563, now seen corresponding path program 40 times [2018-02-02 21:11:57,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:57,047 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:57,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:57,048 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:57,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:57,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-02 21:11:57,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:57,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:57,660 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:11:57,671 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:11:57,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:57,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-02 21:11:57,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:57,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-02-02 21:11:57,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 21:11:57,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 21:11:57,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:11:57,710 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 44 states. [2018-02-02 21:11:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:57,966 INFO L93 Difference]: Finished difference Result 395 states and 413 transitions. [2018-02-02 21:11:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 21:11:57,966 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 294 [2018-02-02 21:11:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:57,967 INFO L225 Difference]: With dead ends: 395 [2018-02-02 21:11:57,967 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 21:11:57,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:11:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 21:11:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 299. [2018-02-02 21:11:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 21:11:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-02-02 21:11:57,971 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-02-02 21:11:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:57,971 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-02-02 21:11:57,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 21:11:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-02-02 21:11:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-02 21:11:57,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:57,973 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:57,973 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash -264105196, now seen corresponding path program 41 times [2018-02-02 21:11:57,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:57,974 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:57,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:57,974 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:57,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:57,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4956 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-02 21:11:58,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:58,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:58,540 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:11:58,599 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-02-02 21:11:58,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:58,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4956 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-02 21:11:58,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:58,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-02-02 21:11:58,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 21:11:58,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 21:11:58,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 21:11:58,638 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 45 states. [2018-02-02 21:11:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:11:58,975 INFO L93 Difference]: Finished difference Result 404 states and 423 transitions. [2018-02-02 21:11:58,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 21:11:58,975 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 298 [2018-02-02 21:11:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:11:58,976 INFO L225 Difference]: With dead ends: 404 [2018-02-02 21:11:58,976 INFO L226 Difference]: Without dead ends: 404 [2018-02-02 21:11:58,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 21:11:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-02-02 21:11:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 303. [2018-02-02 21:11:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 21:11:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-02-02 21:11:58,979 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 298 [2018-02-02 21:11:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:11:58,979 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-02-02 21:11:58,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 21:11:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-02-02 21:11:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-02 21:11:58,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:11:58,980 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:11:58,980 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:11:58,981 INFO L82 PathProgramCache]: Analyzing trace with hash 636714573, now seen corresponding path program 42 times [2018-02-02 21:11:58,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:11:58,981 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:11:58,981 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:58,981 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:11:58,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:11:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:11:58,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:11:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5126 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-02 21:11:59,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:11:59,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:11:59,600 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:11:59,734 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-02-02 21:11:59,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:11:59,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:11:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5126 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-02-02 21:11:59,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:11:59,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 27] total 48 [2018-02-02 21:11:59,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 21:11:59,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 21:11:59,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1176, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 21:11:59,823 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 48 states. [2018-02-02 21:12:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:00,319 INFO L93 Difference]: Finished difference Result 413 states and 432 transitions. [2018-02-02 21:12:00,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 21:12:00,319 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 302 [2018-02-02 21:12:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:00,320 INFO L225 Difference]: With dead ends: 413 [2018-02-02 21:12:00,320 INFO L226 Difference]: Without dead ends: 413 [2018-02-02 21:12:00,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2208, Invalid=2904, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 21:12:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-02 21:12:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 312. [2018-02-02 21:12:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-02 21:12:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2018-02-02 21:12:00,323 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 302 [2018-02-02 21:12:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:00,323 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2018-02-02 21:12:00,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 21:12:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2018-02-02 21:12:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-02-02 21:12:00,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:00,324 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:00,324 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash -611664196, now seen corresponding path program 43 times [2018-02-02 21:12:00,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:00,324 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:00,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:00,324 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:00,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:00,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5422 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-02-02 21:12:00,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:00,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:00,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:12:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:00,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5422 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-02-02 21:12:00,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:00,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-02-02 21:12:00,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 21:12:00,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 21:12:00,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 21:12:00,981 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 47 states. [2018-02-02 21:12:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:01,374 INFO L93 Difference]: Finished difference Result 422 states and 442 transitions. [2018-02-02 21:12:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 21:12:01,374 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 311 [2018-02-02 21:12:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:01,376 INFO L225 Difference]: With dead ends: 422 [2018-02-02 21:12:01,376 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 21:12:01,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 21:12:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 21:12:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 316. [2018-02-02 21:12:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 21:12:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 317 transitions. [2018-02-02 21:12:01,379 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 317 transitions. Word has length 311 [2018-02-02 21:12:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:01,380 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 317 transitions. [2018-02-02 21:12:01,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 21:12:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 317 transitions. [2018-02-02 21:12:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-02-02 21:12:01,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:01,381 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:01,381 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 723589155, now seen corresponding path program 44 times [2018-02-02 21:12:01,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:01,382 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:01,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:01,382 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:12:01,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:01,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-02-02 21:12:02,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:02,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:02,211 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:12:02,221 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:12:02,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:02,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-02-02 21:12:02,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:02,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 28] total 52 [2018-02-02 21:12:02,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 21:12:02,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 21:12:02,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=1426, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 21:12:02,457 INFO L87 Difference]: Start difference. First operand 316 states and 317 transitions. Second operand 52 states. [2018-02-02 21:12:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:03,252 INFO L93 Difference]: Finished difference Result 431 states and 451 transitions. [2018-02-02 21:12:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 21:12:03,252 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 315 [2018-02-02 21:12:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:03,253 INFO L225 Difference]: With dead ends: 431 [2018-02-02 21:12:03,253 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 21:12:03,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2448, Invalid=3404, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 21:12:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 21:12:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 325. [2018-02-02 21:12:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 21:12:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-02-02 21:12:03,265 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 315 [2018-02-02 21:12:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:03,266 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-02-02 21:12:03,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 21:12:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-02-02 21:12:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-02-02 21:12:03,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:03,267 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:03,267 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2145714120, now seen corresponding path program 45 times [2018-02-02 21:12:03,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:03,267 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:03,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:03,267 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:03,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:03,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5909 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2018-02-02 21:12:04,158 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:04,158 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:04,158 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:12:04,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-02-02 21:12:04,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:04,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5909 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-02-02 21:12:04,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:04,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 29] total 51 [2018-02-02 21:12:04,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 21:12:04,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 21:12:04,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1223, Invalid=1327, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:12:04,268 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 51 states. [2018-02-02 21:12:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:04,898 INFO L93 Difference]: Finished difference Result 440 states and 460 transitions. [2018-02-02 21:12:04,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 21:12:04,898 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 324 [2018-02-02 21:12:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:04,899 INFO L225 Difference]: With dead ends: 440 [2018-02-02 21:12:04,899 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 21:12:04,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2523, Invalid=3329, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 21:12:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 21:12:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 334. [2018-02-02 21:12:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 21:12:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-02-02 21:12:04,901 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 324 [2018-02-02 21:12:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:04,901 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-02-02 21:12:04,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 21:12:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-02-02 21:12:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-02-02 21:12:04,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:04,902 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:04,903 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1921187727, now seen corresponding path program 46 times [2018-02-02 21:12:04,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:04,903 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:04,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:04,903 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:04,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:04,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6227 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-02-02 21:12:05,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:05,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:05,641 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:12:05,652 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:12:05,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:05,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6227 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-02 21:12:05,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:05,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 29] total 78 [2018-02-02 21:12:05,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-02 21:12:05,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-02 21:12:05,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3759, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 21:12:05,889 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 78 states. [2018-02-02 21:12:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:07,553 INFO L93 Difference]: Finished difference Result 449 states and 469 transitions. [2018-02-02 21:12:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 21:12:07,553 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 333 [2018-02-02 21:12:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:07,554 INFO L225 Difference]: With dead ends: 449 [2018-02-02 21:12:07,554 INFO L226 Difference]: Without dead ends: 449 [2018-02-02 21:12:07,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2247, Invalid=3759, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 21:12:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-02 21:12:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 343. [2018-02-02 21:12:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 21:12:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-02-02 21:12:07,556 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2018-02-02 21:12:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:07,557 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-02-02 21:12:07,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-02 21:12:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-02-02 21:12:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-02-02 21:12:07,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:07,558 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:07,558 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1330891882, now seen corresponding path program 47 times [2018-02-02 21:12:07,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:07,558 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:07,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:07,558 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:07,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:07,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6554 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2018-02-02 21:12:08,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:08,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:08,326 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:12:09,078 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-02-02 21:12:09,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:09,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6554 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2018-02-02 21:12:09,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:09,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-02-02 21:12:09,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 21:12:09,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 21:12:09,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:12:09,133 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 51 states. [2018-02-02 21:12:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:09,449 INFO L93 Difference]: Finished difference Result 458 states and 479 transitions. [2018-02-02 21:12:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 21:12:09,450 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 342 [2018-02-02 21:12:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:09,451 INFO L225 Difference]: With dead ends: 458 [2018-02-02 21:12:09,451 INFO L226 Difference]: Without dead ends: 458 [2018-02-02 21:12:09,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:12:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-02 21:12:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 347. [2018-02-02 21:12:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-02 21:12:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-02-02 21:12:09,454 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 342 [2018-02-02 21:12:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:09,455 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-02-02 21:12:09,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 21:12:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-02-02 21:12:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-02-02 21:12:09,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:09,457 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:09,457 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash 513541667, now seen corresponding path program 48 times [2018-02-02 21:12:09,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:09,457 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:09,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:09,458 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:09,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:09,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6748 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2018-02-02 21:12:10,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:10,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:10,278 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:12:10,409 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-02-02 21:12:10,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:10,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6748 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-02-02 21:12:10,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:10,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 31] total 54 [2018-02-02 21:12:10,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 21:12:10,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 21:12:10,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1375, Invalid=1487, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 21:12:10,496 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 54 states. [2018-02-02 21:12:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:11,112 INFO L93 Difference]: Finished difference Result 467 states and 488 transitions. [2018-02-02 21:12:11,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 21:12:11,112 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 346 [2018-02-02 21:12:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:11,113 INFO L225 Difference]: With dead ends: 467 [2018-02-02 21:12:11,113 INFO L226 Difference]: Without dead ends: 467 [2018-02-02 21:12:11,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2859, Invalid=3783, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 21:12:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-02 21:12:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 356. [2018-02-02 21:12:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-02 21:12:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-02-02 21:12:11,116 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 346 [2018-02-02 21:12:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:11,116 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-02-02 21:12:11,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 21:12:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-02-02 21:12:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-02-02 21:12:11,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:11,117 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:11,117 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash -466276826, now seen corresponding path program 49 times [2018-02-02 21:12:11,117 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:11,117 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:11,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:11,118 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:11,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:11,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7088 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-02-02 21:12:11,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:11,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:11,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:12:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:11,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7088 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-02-02 21:12:12,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:12,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-02-02 21:12:12,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 21:12:12,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 21:12:12,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 21:12:12,015 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 53 states. [2018-02-02 21:12:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:12,362 INFO L93 Difference]: Finished difference Result 476 states and 498 transitions. [2018-02-02 21:12:12,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 21:12:12,362 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 355 [2018-02-02 21:12:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:12,363 INFO L225 Difference]: With dead ends: 476 [2018-02-02 21:12:12,363 INFO L226 Difference]: Without dead ends: 476 [2018-02-02 21:12:12,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 21:12:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-02 21:12:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 360. [2018-02-02 21:12:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-02 21:12:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2018-02-02 21:12:12,365 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 355 [2018-02-02 21:12:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:12,366 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2018-02-02 21:12:12,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 21:12:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2018-02-02 21:12:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-02-02 21:12:12,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:12,367 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:12,367 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash -988264179, now seen corresponding path program 50 times [2018-02-02 21:12:12,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:12,367 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:12,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:12,368 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:12:12,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:12,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7290 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-02-02 21:12:13,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:13,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:13,237 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:12:13,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:12:13,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:13,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7290 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-02-02 21:12:13,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:13,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 32] total 62 [2018-02-02 21:12:13,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 21:12:13,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 21:12:13,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1659, Invalid=2123, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 21:12:13,377 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 62 states. [2018-02-02 21:12:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:14,318 INFO L93 Difference]: Finished difference Result 485 states and 507 transitions. [2018-02-02 21:12:14,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 21:12:14,318 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 359 [2018-02-02 21:12:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:14,319 INFO L225 Difference]: With dead ends: 485 [2018-02-02 21:12:14,319 INFO L226 Difference]: Without dead ends: 485 [2018-02-02 21:12:14,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3233, Invalid=4957, Unknown=0, NotChecked=0, Total=8190 [2018-02-02 21:12:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-02 21:12:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 369. [2018-02-02 21:12:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-02 21:12:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-02-02 21:12:14,321 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 359 [2018-02-02 21:12:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:14,322 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-02-02 21:12:14,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 21:12:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-02-02 21:12:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-02-02 21:12:14,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:14,323 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:14,323 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:14,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1482375154, now seen corresponding path program 51 times [2018-02-02 21:12:14,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:14,323 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:14,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:14,323 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:14,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:14,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7643 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-02-02 21:12:15,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:15,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:15,221 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:12:15,270 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-02-02 21:12:15,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:15,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7643 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-02-02 21:12:15,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:15,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 33] total 57 [2018-02-02 21:12:15,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 21:12:15,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 21:12:15,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1536, Invalid=1656, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 21:12:15,358 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 57 states. [2018-02-02 21:12:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:16,079 INFO L93 Difference]: Finished difference Result 494 states and 516 transitions. [2018-02-02 21:12:16,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 21:12:16,080 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 368 [2018-02-02 21:12:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:16,081 INFO L225 Difference]: With dead ends: 494 [2018-02-02 21:12:16,081 INFO L226 Difference]: Without dead ends: 494 [2018-02-02 21:12:16,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3216, Invalid=4266, Unknown=0, NotChecked=0, Total=7482 [2018-02-02 21:12:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-02 21:12:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 378. [2018-02-02 21:12:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-02 21:12:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-02-02 21:12:16,083 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 368 [2018-02-02 21:12:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:16,083 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-02-02 21:12:16,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 21:12:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-02-02 21:12:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-02-02 21:12:16,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:16,084 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:16,084 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1383131173, now seen corresponding path program 52 times [2018-02-02 21:12:16,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:16,085 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:16,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:16,085 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:16,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:16,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8005 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-02 21:12:17,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:17,006 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:17,006 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:12:17,017 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:12:17,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:17,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8005 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-02 21:12:17,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:17,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-02-02 21:12:17,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 21:12:17,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 21:12:17,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 21:12:17,078 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 56 states. [2018-02-02 21:12:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:17,458 INFO L93 Difference]: Finished difference Result 503 states and 526 transitions. [2018-02-02 21:12:17,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 21:12:17,459 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 377 [2018-02-02 21:12:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:17,459 INFO L225 Difference]: With dead ends: 503 [2018-02-02 21:12:17,460 INFO L226 Difference]: Without dead ends: 503 [2018-02-02 21:12:17,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 21:12:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-02 21:12:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 382. [2018-02-02 21:12:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 21:12:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2018-02-02 21:12:17,462 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 377 [2018-02-02 21:12:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:17,462 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 383 transitions. [2018-02-02 21:12:17,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 21:12:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 383 transitions. [2018-02-02 21:12:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-02-02 21:12:17,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:17,463 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:17,463 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1854143362, now seen corresponding path program 53 times [2018-02-02 21:12:17,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:17,464 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:17,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:17,464 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:17,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:17,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8219 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-02 21:12:18,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:18,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:18,457 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:12:20,139 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-02-02 21:12:20,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:20,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8219 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-02 21:12:20,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:20,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-02-02 21:12:20,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 21:12:20,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 21:12:20,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 21:12:20,234 INFO L87 Difference]: Start difference. First operand 382 states and 383 transitions. Second operand 57 states. [2018-02-02 21:12:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:20,605 INFO L93 Difference]: Finished difference Result 512 states and 536 transitions. [2018-02-02 21:12:20,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 21:12:20,605 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 381 [2018-02-02 21:12:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:20,606 INFO L225 Difference]: With dead ends: 512 [2018-02-02 21:12:20,606 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 21:12:20,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 21:12:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 21:12:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 386. [2018-02-02 21:12:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-02 21:12:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 387 transitions. [2018-02-02 21:12:20,609 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 387 transitions. Word has length 381 [2018-02-02 21:12:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:20,609 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 387 transitions. [2018-02-02 21:12:20,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 21:12:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 387 transitions. [2018-02-02 21:12:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-02-02 21:12:20,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:20,610 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:20,610 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash 494973865, now seen corresponding path program 54 times [2018-02-02 21:12:20,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:20,610 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:20,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:20,611 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:20,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:20,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8437 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-02 21:12:21,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:21,622 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:21,623 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:12:21,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-02-02 21:12:21,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:21,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8437 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-02-02 21:12:21,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:21,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 34] total 60 [2018-02-02 21:12:21,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 21:12:21,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 21:12:21,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1708, Invalid=1832, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 21:12:21,799 INFO L87 Difference]: Start difference. First operand 386 states and 387 transitions. Second operand 60 states. [2018-02-02 21:12:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:22,554 INFO L93 Difference]: Finished difference Result 521 states and 545 transitions. [2018-02-02 21:12:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 21:12:22,554 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 385 [2018-02-02 21:12:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:22,555 INFO L225 Difference]: With dead ends: 521 [2018-02-02 21:12:22,556 INFO L226 Difference]: Without dead ends: 521 [2018-02-02 21:12:22,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3537, Invalid=4653, Unknown=0, NotChecked=0, Total=8190 [2018-02-02 21:12:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-02 21:12:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 395. [2018-02-02 21:12:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 21:12:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-02-02 21:12:22,558 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 385 [2018-02-02 21:12:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:22,558 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-02-02 21:12:22,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 21:12:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-02-02 21:12:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-02-02 21:12:22,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:22,559 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:22,559 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1457906098, now seen corresponding path program 55 times [2018-02-02 21:12:22,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:22,560 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:22,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:22,560 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:22,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:22,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8816 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-02-02 21:12:23,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:23,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:23,672 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:12:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:23,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8816 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-02-02 21:12:23,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:23,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-02-02 21:12:23,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 21:12:23,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 21:12:23,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:12:23,744 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 59 states. [2018-02-02 21:12:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:24,235 INFO L93 Difference]: Finished difference Result 530 states and 555 transitions. [2018-02-02 21:12:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 21:12:24,235 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 394 [2018-02-02 21:12:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:24,236 INFO L225 Difference]: With dead ends: 530 [2018-02-02 21:12:24,236 INFO L226 Difference]: Without dead ends: 530 [2018-02-02 21:12:24,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:12:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-02 21:12:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 399. [2018-02-02 21:12:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 21:12:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-02-02 21:12:24,238 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 394 [2018-02-02 21:12:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:24,238 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-02-02 21:12:24,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 21:12:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-02-02 21:12:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-02-02 21:12:24,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:24,240 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:24,240 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1289887509, now seen corresponding path program 56 times [2018-02-02 21:12:24,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:24,240 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:24,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:24,240 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:12:24,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:24,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9042 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-02-02 21:12:25,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:25,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:25,212 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:12:25,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:12:25,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:25,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9042 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-02-02 21:12:25,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:25,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 34] total 93 [2018-02-02 21:12:25,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-02-02 21:12:25,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-02-02 21:12:25,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3222, Invalid=5334, Unknown=0, NotChecked=0, Total=8556 [2018-02-02 21:12:25,508 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 93 states. [2018-02-02 21:12:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:27,549 INFO L93 Difference]: Finished difference Result 539 states and 564 transitions. [2018-02-02 21:12:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 21:12:27,549 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 398 [2018-02-02 21:12:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:27,551 INFO L225 Difference]: With dead ends: 539 [2018-02-02 21:12:27,551 INFO L226 Difference]: Without dead ends: 539 [2018-02-02 21:12:27,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3222, Invalid=5334, Unknown=0, NotChecked=0, Total=8556 [2018-02-02 21:12:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-02 21:12:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 408. [2018-02-02 21:12:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-02 21:12:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2018-02-02 21:12:27,553 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 398 [2018-02-02 21:12:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:27,553 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2018-02-02 21:12:27,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-02-02 21:12:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2018-02-02 21:12:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-02-02 21:12:27,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:27,555 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:27,555 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2033501474, now seen corresponding path program 57 times [2018-02-02 21:12:27,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:27,555 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:27,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:27,555 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:27,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:27,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9434 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-02-02 21:12:28,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:28,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:28,613 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:12:28,663 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-02 21:12:28,663 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:28,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9434 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-02-02 21:12:28,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:28,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 36] total 63 [2018-02-02 21:12:28,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 21:12:28,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 21:12:28,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1887, Invalid=2019, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 21:12:28,746 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 63 states. [2018-02-02 21:12:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:29,491 INFO L93 Difference]: Finished difference Result 548 states and 573 transitions. [2018-02-02 21:12:29,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 21:12:29,491 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 407 [2018-02-02 21:12:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:29,492 INFO L225 Difference]: With dead ends: 548 [2018-02-02 21:12:29,492 INFO L226 Difference]: Without dead ends: 548 [2018-02-02 21:12:29,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3933, Invalid=5187, Unknown=0, NotChecked=0, Total=9120 [2018-02-02 21:12:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-02 21:12:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 417. [2018-02-02 21:12:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-02-02 21:12:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-02-02 21:12:29,495 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 407 [2018-02-02 21:12:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:29,495 INFO L432 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-02-02 21:12:29,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 21:12:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-02-02 21:12:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-02-02 21:12:29,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:29,496 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:29,496 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1447826141, now seen corresponding path program 58 times [2018-02-02 21:12:29,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:29,496 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:29,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:29,497 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:29,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:29,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9835 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-02 21:12:30,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:30,591 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:30,591 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:12:30,603 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:12:30,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:30,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9835 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-02 21:12:30,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:30,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-02-02 21:12:30,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 21:12:30,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 21:12:30,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 21:12:30,683 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 62 states. [2018-02-02 21:12:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:31,140 INFO L93 Difference]: Finished difference Result 557 states and 583 transitions. [2018-02-02 21:12:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 21:12:31,140 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 416 [2018-02-02 21:12:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:31,141 INFO L225 Difference]: With dead ends: 557 [2018-02-02 21:12:31,141 INFO L226 Difference]: Without dead ends: 557 [2018-02-02 21:12:31,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 21:12:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-02 21:12:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2018-02-02 21:12:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-02-02 21:12:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-02-02 21:12:31,144 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 416 [2018-02-02 21:12:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:31,144 INFO L432 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-02-02 21:12:31,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 21:12:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-02-02 21:12:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-02-02 21:12:31,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:31,145 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:31,145 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1946816170, now seen corresponding path program 59 times [2018-02-02 21:12:31,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:31,145 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:31,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:31,146 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:31,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:31,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:12:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10073 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-02 21:12:32,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:12:32,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:12:32,268 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:12:35,199 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2018-02-02 21:12:35,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:12:35,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:12:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10073 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-02 21:12:35,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:12:35,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-02-02 21:12:35,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 21:12:35,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 21:12:35,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 21:12:35,346 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 63 states. [2018-02-02 21:12:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:12:35,817 INFO L93 Difference]: Finished difference Result 566 states and 593 transitions. [2018-02-02 21:12:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-02 21:12:35,817 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 420 [2018-02-02 21:12:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:12:35,818 INFO L225 Difference]: With dead ends: 566 [2018-02-02 21:12:35,818 INFO L226 Difference]: Without dead ends: 566 [2018-02-02 21:12:35,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 21:12:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-02-02 21:12:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 425. [2018-02-02 21:12:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 21:12:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-02-02 21:12:35,820 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 420 [2018-02-02 21:12:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:12:35,821 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-02-02 21:12:35,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 21:12:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-02-02 21:12:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-02-02 21:12:35,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:12:35,822 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:12:35,822 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:12:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash 69856079, now seen corresponding path program 60 times [2018-02-02 21:12:35,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:12:35,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:12:35,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:35,822 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:12:35,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:12:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:12:35,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 21:12:36,793 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 21:12:36,795 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 21:12:36,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:12:36 BoogieIcfgContainer [2018-02-02 21:12:36,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:12:36,796 INFO L168 Benchmark]: Toolchain (without parser) took 68644.30 ms. Allocated memory was 397.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 351.5 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 21:12:36,797 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.4 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:12:36,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.96 ms. Allocated memory is still 397.4 MB. Free memory was 351.5 MB in the beginning and 343.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 21:12:36,797 INFO L168 Benchmark]: Boogie Preprocessor took 17.87 ms. Allocated memory is still 397.4 MB. Free memory is still 343.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:12:36,797 INFO L168 Benchmark]: RCFGBuilder took 128.18 ms. Allocated memory is still 397.4 MB. Free memory was 343.5 MB in the beginning and 329.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:12:36,797 INFO L168 Benchmark]: TraceAbstraction took 68354.48 ms. Allocated memory was 397.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.0 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-02 21:12:36,798 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 397.4 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 140.96 ms. Allocated memory is still 397.4 MB. Free memory was 351.5 MB in the beginning and 343.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.87 ms. Allocated memory is still 397.4 MB. Free memory is still 343.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 128.18 ms. Allocated memory is still 397.4 MB. Free memory was 343.5 MB in the beginning and 329.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 68354.48 ms. Allocated memory was 397.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.0 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 425 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 57 known predicates. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 425 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 57 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 68.3s OverallTime, 62 OverallIterations, 62 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 904 SDtfs, 17910 SDslu, 16731 SDs, 0 SdLazy, 44138 SolverSat, 5186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15950 GetRequests, 13428 SyntacticMatches, 1 SemanticMatches, 2521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18677 ImplicationChecksByTransitivity, 24.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=61, 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.2s AutomataMinimizationTime, 61 MinimizatonAttempts, 4395 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 10.8s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 26316 NumberOfCodeBlocks, 25780 NumberOfCodeBlocksAsserted, 925 NumberOfCheckSat, 26196 ConstructedInterpolants, 0 QuantifiedInterpolants, 15529978 SizeOfPredicates, 27 NumberOfNonLiveVariables, 23653 ConjunctsInSsa, 1720 ConjunctsInUnsatCore, 120 InterpolantComputations, 2 PerfectInterpolantSequences, 166794/415198 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-12-36-803.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_21-12-36-803.csv Completed graceful shutdown