java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:32,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:32,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:32,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:32,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:32,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:32,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:32,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:32,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:32,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:32,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:32,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:32,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:32,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:32,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:32,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:32,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:32,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:32,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:32,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:32,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:32,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:32,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:32,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:32,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:32,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:32,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:32,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:32,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:32,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:32,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:32,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:32,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:32,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:32,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:32,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:32,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:32,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:32,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:32,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:32,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:32,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:14:32,280 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:32,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:32,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:32,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:32,284 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:32,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:32,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:32,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:32,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:32,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:32,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:32,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:32,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:32,287 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:32,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:32,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:32,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:32,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:32,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:32,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:32,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:32,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:32,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:32,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:32,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:32,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:32,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:32,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:32,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:32,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:32,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:32,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:32,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:32,612 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:32,613 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-10-13 19:14:32,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3d8d9a5/03f46de672e44f258de3d42188253d93/FLAGff99ff6bf [2019-10-13 19:14:33,148 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:33,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-10-13 19:14:33,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3d8d9a5/03f46de672e44f258de3d42188253d93/FLAGff99ff6bf [2019-10-13 19:14:33,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3d8d9a5/03f46de672e44f258de3d42188253d93 [2019-10-13 19:14:33,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:33,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:33,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:33,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:33,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:33,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:33,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1168eabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33, skipping insertion in model container [2019-10-13 19:14:33,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:33,596 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:33,617 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:33,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:33,832 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:33,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:33,971 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:33,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33 WrapperNode [2019-10-13 19:14:33,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:33,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:33,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:33,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:33,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:33,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:33,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:33,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:34,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:34,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:34,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:34,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:34,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:34,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:34,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:34,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-13 19:14:34,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:34,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:34,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:34,431 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:34,432 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:34,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:34 BoogieIcfgContainer [2019-10-13 19:14:34,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:34,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:34,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:34,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:34,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:33" (1/3) ... [2019-10-13 19:14:34,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6952eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:34, skipping insertion in model container [2019-10-13 19:14:34,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33" (2/3) ... [2019-10-13 19:14:34,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6952eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:34, skipping insertion in model container [2019-10-13 19:14:34,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:34" (3/3) ... [2019-10-13 19:14:34,441 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-13 19:14:34,450 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:34,457 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:34,464 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:34,488 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:34,488 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:34,489 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:34,489 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:34,489 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:34,489 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:34,489 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:34,490 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-13 19:14:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:34,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:34,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:34,514 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-10-13 19:14:34,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:34,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602016340] [2019-10-13 19:14:34,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:34,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602016340] [2019-10-13 19:14:34,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:34,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:34,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044861134] [2019-10-13 19:14:34,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:34,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:34,714 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-10-13 19:14:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:34,777 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2019-10-13 19:14:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:34,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:34,791 INFO L225 Difference]: With dead ends: 87 [2019-10-13 19:14:34,792 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 19:14:34,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 19:14:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-10-13 19:14:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 19:14:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-10-13 19:14:34,833 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-10-13 19:14:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:34,833 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-10-13 19:14:34,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-10-13 19:14:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:34,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:34,835 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:34,835 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-10-13 19:14:34,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:34,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716276676] [2019-10-13 19:14:34,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:34,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716276676] [2019-10-13 19:14:34,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:34,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:34,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720113367] [2019-10-13 19:14:34,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:34,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:34,916 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-10-13 19:14:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:34,955 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2019-10-13 19:14:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:34,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:34,957 INFO L225 Difference]: With dead ends: 117 [2019-10-13 19:14:34,957 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 19:14:34,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 19:14:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-13 19:14:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 19:14:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-10-13 19:14:34,984 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-10-13 19:14:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:34,984 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-10-13 19:14:34,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-10-13 19:14:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:34,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:34,986 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:34,986 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-10-13 19:14:34,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:34,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748939171] [2019-10-13 19:14:34,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748939171] [2019-10-13 19:14:35,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516727716] [2019-10-13 19:14:35,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,049 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-10-13 19:14:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,071 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2019-10-13 19:14:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,073 INFO L225 Difference]: With dead ends: 108 [2019-10-13 19:14:35,073 INFO L226 Difference]: Without dead ends: 75 [2019-10-13 19:14:35,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-13 19:14:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-13 19:14:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 19:14:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-10-13 19:14:35,085 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-10-13 19:14:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,087 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-10-13 19:14:35,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-10-13 19:14:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:35,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,090 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-10-13 19:14:35,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324508965] [2019-10-13 19:14:35,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324508965] [2019-10-13 19:14:35,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538337635] [2019-10-13 19:14:35,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,182 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-10-13 19:14:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,230 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2019-10-13 19:14:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,234 INFO L225 Difference]: With dead ends: 136 [2019-10-13 19:14:35,234 INFO L226 Difference]: Without dead ends: 134 [2019-10-13 19:14:35,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-13 19:14:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-10-13 19:14:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-13 19:14:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-10-13 19:14:35,249 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-10-13 19:14:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,250 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-10-13 19:14:35,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-10-13 19:14:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:35,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,254 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,256 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-10-13 19:14:35,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105711852] [2019-10-13 19:14:35,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105711852] [2019-10-13 19:14:35,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962299466] [2019-10-13 19:14:35,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,335 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-10-13 19:14:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,364 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2019-10-13 19:14:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,366 INFO L225 Difference]: With dead ends: 224 [2019-10-13 19:14:35,367 INFO L226 Difference]: Without dead ends: 136 [2019-10-13 19:14:35,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-13 19:14:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-10-13 19:14:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-13 19:14:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-10-13 19:14:35,380 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-10-13 19:14:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,380 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-10-13 19:14:35,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-10-13 19:14:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:35,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,382 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,382 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-10-13 19:14:35,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199200597] [2019-10-13 19:14:35,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199200597] [2019-10-13 19:14:35,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609774933] [2019-10-13 19:14:35,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,432 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-10-13 19:14:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,451 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2019-10-13 19:14:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,453 INFO L225 Difference]: With dead ends: 201 [2019-10-13 19:14:35,453 INFO L226 Difference]: Without dead ends: 138 [2019-10-13 19:14:35,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-13 19:14:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-13 19:14:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 19:14:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-10-13 19:14:35,465 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-10-13 19:14:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,466 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-10-13 19:14:35,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-10-13 19:14:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:35,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,467 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,468 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,468 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-10-13 19:14:35,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745295295] [2019-10-13 19:14:35,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745295295] [2019-10-13 19:14:35,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040521376] [2019-10-13 19:14:35,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,503 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-10-13 19:14:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,544 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2019-10-13 19:14:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,548 INFO L225 Difference]: With dead ends: 252 [2019-10-13 19:14:35,548 INFO L226 Difference]: Without dead ends: 250 [2019-10-13 19:14:35,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-13 19:14:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-10-13 19:14:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-13 19:14:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-10-13 19:14:35,567 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-10-13 19:14:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,567 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-10-13 19:14:35,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-10-13 19:14:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:35,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,569 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,569 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-10-13 19:14:35,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534245213] [2019-10-13 19:14:35,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534245213] [2019-10-13 19:14:35,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551523259] [2019-10-13 19:14:35,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,606 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-10-13 19:14:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,628 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2019-10-13 19:14:35,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,631 INFO L225 Difference]: With dead ends: 432 [2019-10-13 19:14:35,631 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 19:14:35,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 19:14:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-13 19:14:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-13 19:14:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-10-13 19:14:35,644 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-10-13 19:14:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,644 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-10-13 19:14:35,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-10-13 19:14:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,648 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,648 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-10-13 19:14:35,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397585083] [2019-10-13 19:14:35,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397585083] [2019-10-13 19:14:35,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359286143] [2019-10-13 19:14:35,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,692 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-10-13 19:14:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,718 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2019-10-13 19:14:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,720 INFO L225 Difference]: With dead ends: 384 [2019-10-13 19:14:35,721 INFO L226 Difference]: Without dead ends: 262 [2019-10-13 19:14:35,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-13 19:14:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-13 19:14:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-13 19:14:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-10-13 19:14:35,738 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-10-13 19:14:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,738 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-10-13 19:14:35,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-10-13 19:14:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,749 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-10-13 19:14:35,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877200705] [2019-10-13 19:14:35,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877200705] [2019-10-13 19:14:35,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373095740] [2019-10-13 19:14:35,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,802 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-10-13 19:14:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,838 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2019-10-13 19:14:35,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,842 INFO L225 Difference]: With dead ends: 476 [2019-10-13 19:14:35,843 INFO L226 Difference]: Without dead ends: 474 [2019-10-13 19:14:35,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-13 19:14:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-10-13 19:14:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 19:14:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-10-13 19:14:35,856 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-10-13 19:14:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,857 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-10-13 19:14:35,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-10-13 19:14:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,859 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-10-13 19:14:35,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859364855] [2019-10-13 19:14:35,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859364855] [2019-10-13 19:14:35,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899412863] [2019-10-13 19:14:35,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,891 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-10-13 19:14:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,918 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2019-10-13 19:14:35,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,923 INFO L225 Difference]: With dead ends: 844 [2019-10-13 19:14:35,924 INFO L226 Difference]: Without dead ends: 498 [2019-10-13 19:14:35,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-13 19:14:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-10-13 19:14:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-13 19:14:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-10-13 19:14:35,951 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-10-13 19:14:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,951 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-10-13 19:14:35,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-10-13 19:14:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:35,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-10-13 19:14:35,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061788991] [2019-10-13 19:14:35,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061788991] [2019-10-13 19:14:35,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593912981] [2019-10-13 19:14:35,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,999 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-10-13 19:14:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,029 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2019-10-13 19:14:36,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,033 INFO L225 Difference]: With dead ends: 744 [2019-10-13 19:14:36,034 INFO L226 Difference]: Without dead ends: 506 [2019-10-13 19:14:36,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-13 19:14:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-10-13 19:14:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-13 19:14:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-10-13 19:14:36,053 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-10-13 19:14:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,053 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-10-13 19:14:36,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-10-13 19:14:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:36,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,055 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-10-13 19:14:36,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793985418] [2019-10-13 19:14:36,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793985418] [2019-10-13 19:14:36,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785858887] [2019-10-13 19:14:36,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,100 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-10-13 19:14:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,126 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2019-10-13 19:14:36,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,132 INFO L225 Difference]: With dead ends: 908 [2019-10-13 19:14:36,133 INFO L226 Difference]: Without dead ends: 906 [2019-10-13 19:14:36,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-10-13 19:14:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-10-13 19:14:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-13 19:14:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-10-13 19:14:36,157 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-10-13 19:14:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,157 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-10-13 19:14:36,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-10-13 19:14:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:36,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,159 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,159 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-10-13 19:14:36,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382506987] [2019-10-13 19:14:36,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382506987] [2019-10-13 19:14:36,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967764546] [2019-10-13 19:14:36,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,187 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-10-13 19:14:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,218 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2019-10-13 19:14:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,224 INFO L225 Difference]: With dead ends: 1660 [2019-10-13 19:14:36,224 INFO L226 Difference]: Without dead ends: 970 [2019-10-13 19:14:36,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-13 19:14:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-10-13 19:14:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-13 19:14:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-10-13 19:14:36,265 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-10-13 19:14:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,266 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-10-13 19:14:36,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-10-13 19:14:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,269 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,269 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-10-13 19:14:36,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940623857] [2019-10-13 19:14:36,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940623857] [2019-10-13 19:14:36,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990933103] [2019-10-13 19:14:36,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,303 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-10-13 19:14:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,347 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2019-10-13 19:14:36,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,356 INFO L225 Difference]: With dead ends: 1452 [2019-10-13 19:14:36,356 INFO L226 Difference]: Without dead ends: 986 [2019-10-13 19:14:36,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-10-13 19:14:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-10-13 19:14:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-13 19:14:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-10-13 19:14:36,442 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-10-13 19:14:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,443 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-10-13 19:14:36,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-10-13 19:14:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,447 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,447 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-10-13 19:14:36,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684198460] [2019-10-13 19:14:36,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684198460] [2019-10-13 19:14:36,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516214484] [2019-10-13 19:14:36,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,490 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-10-13 19:14:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,541 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2019-10-13 19:14:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,554 INFO L225 Difference]: With dead ends: 1740 [2019-10-13 19:14:36,554 INFO L226 Difference]: Without dead ends: 1738 [2019-10-13 19:14:36,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-13 19:14:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-10-13 19:14:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-10-13 19:14:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-10-13 19:14:36,616 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-10-13 19:14:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,617 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-10-13 19:14:36,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-10-13 19:14:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,622 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,622 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-10-13 19:14:36,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173684164] [2019-10-13 19:14:36,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173684164] [2019-10-13 19:14:36,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443992867] [2019-10-13 19:14:36,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,655 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-10-13 19:14:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,709 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2019-10-13 19:14:36,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,719 INFO L225 Difference]: With dead ends: 3276 [2019-10-13 19:14:36,720 INFO L226 Difference]: Without dead ends: 1898 [2019-10-13 19:14:36,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-10-13 19:14:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-10-13 19:14:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-10-13 19:14:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-10-13 19:14:36,785 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-10-13 19:14:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,785 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-10-13 19:14:36,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-10-13 19:14:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,788 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,789 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-10-13 19:14:36,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022422868] [2019-10-13 19:14:36,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022422868] [2019-10-13 19:14:36,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171598275] [2019-10-13 19:14:36,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,813 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-10-13 19:14:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,857 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2019-10-13 19:14:36,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,868 INFO L225 Difference]: With dead ends: 2844 [2019-10-13 19:14:36,869 INFO L226 Difference]: Without dead ends: 1930 [2019-10-13 19:14:36,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-13 19:14:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-10-13 19:14:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-13 19:14:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-10-13 19:14:36,931 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-10-13 19:14:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,931 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-10-13 19:14:36,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-10-13 19:14:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,935 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-10-13 19:14:36,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092062821] [2019-10-13 19:14:36,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092062821] [2019-10-13 19:14:36,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235678313] [2019-10-13 19:14:36,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,963 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-10-13 19:14:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,033 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2019-10-13 19:14:37,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,076 INFO L225 Difference]: With dead ends: 3340 [2019-10-13 19:14:37,076 INFO L226 Difference]: Without dead ends: 3338 [2019-10-13 19:14:37,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-13 19:14:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-10-13 19:14:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-10-13 19:14:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-10-13 19:14:37,161 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-10-13 19:14:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,162 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-10-13 19:14:37,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-10-13 19:14:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:37,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,167 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:37,167 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-10-13 19:14:37,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753544205] [2019-10-13 19:14:37,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753544205] [2019-10-13 19:14:37,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132853209] [2019-10-13 19:14:37,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,201 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-10-13 19:14:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,269 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2019-10-13 19:14:37,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,287 INFO L225 Difference]: With dead ends: 6476 [2019-10-13 19:14:37,287 INFO L226 Difference]: Without dead ends: 3722 [2019-10-13 19:14:37,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-13 19:14:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-10-13 19:14:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-10-13 19:14:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-10-13 19:14:37,400 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-10-13 19:14:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,400 INFO L462 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-10-13 19:14:37,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-10-13 19:14:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:37,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,405 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:37,406 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-10-13 19:14:37,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244184484] [2019-10-13 19:14:37,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244184484] [2019-10-13 19:14:37,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510824275] [2019-10-13 19:14:37,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,428 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-10-13 19:14:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,492 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2019-10-13 19:14:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,510 INFO L225 Difference]: With dead ends: 5580 [2019-10-13 19:14:37,511 INFO L226 Difference]: Without dead ends: 3786 [2019-10-13 19:14:37,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-10-13 19:14:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-10-13 19:14:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-13 19:14:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-10-13 19:14:37,646 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-10-13 19:14:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,646 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-10-13 19:14:37,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-10-13 19:14:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:37,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:37,653 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-10-13 19:14:37,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656342635] [2019-10-13 19:14:37,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656342635] [2019-10-13 19:14:37,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423858807] [2019-10-13 19:14:37,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,676 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-10-13 19:14:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,781 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2019-10-13 19:14:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,823 INFO L225 Difference]: With dead ends: 10956 [2019-10-13 19:14:37,824 INFO L226 Difference]: Without dead ends: 7306 [2019-10-13 19:14:37,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-10-13 19:14:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-10-13 19:14:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-13 19:14:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-10-13 19:14:38,015 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-10-13 19:14:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:38,015 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-10-13 19:14:38,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-10-13 19:14:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:38,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:38,025 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:38,026 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-10-13 19:14:38,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:38,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582455648] [2019-10-13 19:14:38,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:38,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582455648] [2019-10-13 19:14:38,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:38,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:38,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500730018] [2019-10-13 19:14:38,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:38,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:38,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,056 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-10-13 19:14:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:38,238 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2019-10-13 19:14:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:38,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:38,255 INFO L225 Difference]: With dead ends: 8076 [2019-10-13 19:14:38,256 INFO L226 Difference]: Without dead ends: 8074 [2019-10-13 19:14:38,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-13 19:14:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-10-13 19:14:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-13 19:14:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-10-13 19:14:38,427 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-10-13 19:14:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:38,427 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-10-13 19:14:38,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-10-13 19:14:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:38,437 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:38,437 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:38,437 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-10-13 19:14:38,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:38,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064003072] [2019-10-13 19:14:38,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:38,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064003072] [2019-10-13 19:14:38,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:38,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:38,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747165934] [2019-10-13 19:14:38,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:38,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:38,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,457 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-10-13 19:14:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:38,731 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2019-10-13 19:14:38,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:38,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:38,763 INFO L225 Difference]: With dead ends: 12172 [2019-10-13 19:14:38,764 INFO L226 Difference]: Without dead ends: 12170 [2019-10-13 19:14:38,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-13 19:14:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-10-13 19:14:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-13 19:14:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-10-13 19:14:39,104 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-10-13 19:14:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,104 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-10-13 19:14:39,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-10-13 19:14:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:39,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:39,131 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-10-13 19:14:39,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574828955] [2019-10-13 19:14:39,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574828955] [2019-10-13 19:14:39,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778752912] [2019-10-13 19:14:39,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,159 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-10-13 19:14:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:39,377 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2019-10-13 19:14:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:39,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:39,406 INFO L225 Difference]: With dead ends: 25228 [2019-10-13 19:14:39,406 INFO L226 Difference]: Without dead ends: 14218 [2019-10-13 19:14:39,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-10-13 19:14:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-10-13 19:14:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-13 19:14:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-10-13 19:14:39,838 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-10-13 19:14:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,839 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-10-13 19:14:39,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-10-13 19:14:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:39,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,859 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:39,859 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-10-13 19:14:39,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15895104] [2019-10-13 19:14:39,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15895104] [2019-10-13 19:14:39,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234752862] [2019-10-13 19:14:39,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,882 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-10-13 19:14:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,044 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2019-10-13 19:14:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,163 INFO L225 Difference]: With dead ends: 21516 [2019-10-13 19:14:40,163 INFO L226 Difference]: Without dead ends: 14602 [2019-10-13 19:14:40,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-10-13 19:14:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-10-13 19:14:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-10-13 19:14:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-10-13 19:14:40,445 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-10-13 19:14:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,446 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-10-13 19:14:40,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-10-13 19:14:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:40,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,465 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:40,465 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-10-13 19:14:40,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608542296] [2019-10-13 19:14:40,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:40,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608542296] [2019-10-13 19:14:40,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049012943] [2019-10-13 19:14:40,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,489 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-10-13 19:14:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,750 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2019-10-13 19:14:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,796 INFO L225 Difference]: With dead ends: 23562 [2019-10-13 19:14:40,797 INFO L226 Difference]: Without dead ends: 23560 [2019-10-13 19:14:40,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-10-13 19:14:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-10-13 19:14:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-10-13 19:14:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-10-13 19:14:41,308 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-10-13 19:14:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,309 INFO L462 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-10-13 19:14:41,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-10-13 19:14:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:41,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,343 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:41,343 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-10-13 19:14:41,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954276429] [2019-10-13 19:14:41,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:41,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954276429] [2019-10-13 19:14:41,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100766504] [2019-10-13 19:14:41,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,367 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-10-13 19:14:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:42,178 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2019-10-13 19:14:42,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:42,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:42,179 INFO L225 Difference]: With dead ends: 50184 [2019-10-13 19:14:42,179 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:42,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:42,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-13 19:14:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:42,265 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:42,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:42,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:42,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:42,308 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:42,309 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:42,309 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:42,309 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:42,309 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:42,309 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:42,310 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-10-13 19:14:42,310 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-10-13 19:14:42,310 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,310 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,310 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,310 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,311 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-10-13 19:14:42,311 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,311 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-13 19:14:42,311 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,311 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,312 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,312 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-10-13 19:14:42,312 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-10-13 19:14:42,313 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-10-13 19:14:42,314 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-13 19:14:42,314 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-10-13 19:14:42,314 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-13 19:14:42,314 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-10-13 19:14:42,315 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,315 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,315 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-13 19:14:42,315 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-13 19:14:42,315 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,315 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,316 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,316 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,316 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,316 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-13 19:14:42,316 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,316 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-10-13 19:14:42,317 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,317 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-13 19:14:42,317 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-13 19:14:42,317 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,317 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 19:14:42,318 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-13 19:14:42,318 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-10-13 19:14:42,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:42 BoogieIcfgContainer [2019-10-13 19:14:42,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:42,338 INFO L168 Benchmark]: Toolchain (without parser) took 8757.34 ms. Allocated memory was 138.9 MB in the beginning and 640.7 MB in the end (delta: 501.7 MB). Free memory was 101.6 MB in the beginning and 483.5 MB in the end (delta: -381.8 MB). Peak memory consumption was 119.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:42,343 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 138.9 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:42,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.69 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 183.4 MB in the end (delta: -82.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:42,350 INFO L168 Benchmark]: Boogie Preprocessor took 43.98 ms. Allocated memory is still 204.5 MB. Free memory was 183.4 MB in the beginning and 181.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:42,350 INFO L168 Benchmark]: RCFGBuilder took 416.53 ms. Allocated memory is still 204.5 MB. Free memory was 181.1 MB in the beginning and 162.8 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:42,352 INFO L168 Benchmark]: TraceAbstraction took 7899.33 ms. Allocated memory was 204.5 MB in the beginning and 640.7 MB in the end (delta: 436.2 MB). Free memory was 162.2 MB in the beginning and 483.5 MB in the end (delta: -321.3 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:42,359 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 138.9 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 391.69 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 183.4 MB in the end (delta: -82.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.98 ms. Allocated memory is still 204.5 MB. Free memory was 183.4 MB in the beginning and 181.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.53 ms. Allocated memory is still 204.5 MB. Free memory was 181.1 MB in the beginning and 162.8 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7899.33 ms. Allocated memory was 204.5 MB in the beginning and 640.7 MB in the end (delta: 436.2 MB). Free memory was 162.2 MB in the beginning and 483.5 MB in the end (delta: -321.3 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. Result: SAFE, OverallTime: 7.8s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...