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/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:44:55,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:44:55,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:44:55,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:44:55,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:44:55,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:44:55,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:44:55,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:44:55,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:44:55,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:44:55,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:44:55,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:44:55,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:44:55,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:44:55,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:44:55,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:44:55,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:44:55,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:44:55,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:44:55,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:44:55,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:44:55,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:44:55,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:44:55,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:44:55,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:44:55,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:44:55,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:44:55,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:44:55,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:44:55,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:44:55,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:44:55,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:44:55,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:44:55,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:44:55,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:44:55,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:44:55,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:44:55,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:44:55,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:44:55,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:44:55,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:44:55,293 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-14 23:44:55,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:44:55,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:44:55,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:44:55,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:44:55,326 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:44:55,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:44:55,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:44:55,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:44:55,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:44:55,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:44:55,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:44:55,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:44:55,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:44:55,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:44:55,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:44:55,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:44:55,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:44:55,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:44:55,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:44:55,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:44:55,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:44:55,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:44:55,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:44:55,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:44:55,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:44:55,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:44:55,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:44:55,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:44:55,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:44:55,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:44:55,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:44:55,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:44:55,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:44:55,694 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:44:55,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:44:55,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d77c17ec/4151ccaf0372435ab65f89aa66ca2b63/FLAGfe780ae6a [2019-10-14 23:44:56,247 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:44:56,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:44:56,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d77c17ec/4151ccaf0372435ab65f89aa66ca2b63/FLAGfe780ae6a [2019-10-14 23:44:56,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d77c17ec/4151ccaf0372435ab65f89aa66ca2b63 [2019-10-14 23:44:56,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:44:56,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:44:56,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:56,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:44:56,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:44:56,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:56" (1/1) ... [2019-10-14 23:44:56,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5d4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:56, skipping insertion in model container [2019-10-14 23:44:56,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:56" (1/1) ... [2019-10-14 23:44:56,655 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:44:56,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:44:57,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:57,330 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:44:57,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:57,490 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:44:57,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57 WrapperNode [2019-10-14 23:44:57,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:57,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:44:57,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:44:57,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:44:57,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:44:57,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:44:57,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:44:57,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:44:57,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (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-14 23:44:57,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:44:57,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:44:57,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:44:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:44:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:44:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:44:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:44:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:44:57,652 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:44:57,652 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:44:57,652 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:44:57,652 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:44:57,652 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:44:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:44:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:44:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:44:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:44:57,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:44:59,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:44:59,066 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:44:59,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:59 BoogieIcfgContainer [2019-10-14 23:44:59,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:44:59,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:44:59,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:44:59,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:44:59,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:44:56" (1/3) ... [2019-10-14 23:44:59,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b641860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:59, skipping insertion in model container [2019-10-14 23:44:59,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (2/3) ... [2019-10-14 23:44:59,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b641860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:59, skipping insertion in model container [2019-10-14 23:44:59,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:59" (3/3) ... [2019-10-14 23:44:59,084 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:44:59,096 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:44:59,117 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:44:59,128 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:44:59,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:44:59,157 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:44:59,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:44:59,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:44:59,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:44:59,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:44:59,158 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:44:59,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:44:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-10-14 23:44:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:44:59,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:59,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:59,199 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:59,204 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-10-14 23:44:59,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:59,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187653068] [2019-10-14 23:44:59,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:59,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:59,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:00,033 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:00,100 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-14 23:45:00,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187653068] [2019-10-14 23:45:00,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:00,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:00,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972255807] [2019-10-14 23:45:00,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:00,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:00,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:00,130 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2019-10-14 23:45:00,472 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-10-14 23:45:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:01,826 INFO L93 Difference]: Finished difference Result 489 states and 838 transitions. [2019-10-14 23:45:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:01,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-14 23:45:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:01,846 INFO L225 Difference]: With dead ends: 489 [2019-10-14 23:45:01,846 INFO L226 Difference]: Without dead ends: 362 [2019-10-14 23:45:01,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-14 23:45:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-14 23:45:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-14 23:45:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-10-14 23:45:01,953 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-10-14 23:45:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:01,954 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-10-14 23:45:01,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-10-14 23:45:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:45:01,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:01,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:01,959 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-10-14 23:45:01,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:01,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454442417] [2019-10-14 23:45:01,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:01,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:01,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:02,579 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:02,616 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-14 23:45:02,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454442417] [2019-10-14 23:45:02,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:02,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:02,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661557960] [2019-10-14 23:45:02,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:02,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:02,620 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 5 states. [2019-10-14 23:45:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:04,443 INFO L93 Difference]: Finished difference Result 1038 states and 1576 transitions. [2019-10-14 23:45:04,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:04,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:45:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:04,449 INFO L225 Difference]: With dead ends: 1038 [2019-10-14 23:45:04,449 INFO L226 Difference]: Without dead ends: 691 [2019-10-14 23:45:04,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-14 23:45:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-10-14 23:45:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-10-14 23:45:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-10-14 23:45:04,505 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-10-14 23:45:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:04,506 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-10-14 23:45:04,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-10-14 23:45:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:45:04,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:04,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:04,513 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-10-14 23:45:04,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:04,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665408808] [2019-10-14 23:45:04,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:04,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:04,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:04,830 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:04,854 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-14 23:45:04,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665408808] [2019-10-14 23:45:04,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:04,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:04,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408039525] [2019-10-14 23:45:04,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:04,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:04,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:04,856 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 4 states. [2019-10-14 23:45:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:06,790 INFO L93 Difference]: Finished difference Result 2021 states and 3044 transitions. [2019-10-14 23:45:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:06,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-14 23:45:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:06,801 INFO L225 Difference]: With dead ends: 2021 [2019-10-14 23:45:06,801 INFO L226 Difference]: Without dead ends: 1364 [2019-10-14 23:45:06,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-10-14 23:45:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-10-14 23:45:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-10-14 23:45:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-10-14 23:45:06,864 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-10-14 23:45:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:06,864 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-10-14 23:45:06,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-10-14 23:45:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:45:06,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:06,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:06,868 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-10-14 23:45:06,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:06,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298241490] [2019-10-14 23:45:06,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:06,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:06,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:07,317 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:07,353 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-14 23:45:07,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298241490] [2019-10-14 23:45:07,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:07,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:07,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632248476] [2019-10-14 23:45:07,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:07,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:07,358 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 4 states. [2019-10-14 23:45:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:09,299 INFO L93 Difference]: Finished difference Result 1822 states and 2765 transitions. [2019-10-14 23:45:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:09,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-14 23:45:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:09,311 INFO L225 Difference]: With dead ends: 1822 [2019-10-14 23:45:09,311 INFO L226 Difference]: Without dead ends: 1330 [2019-10-14 23:45:09,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-10-14 23:45:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-10-14 23:45:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-10-14 23:45:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-10-14 23:45:09,411 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-10-14 23:45:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:09,412 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-10-14 23:45:09,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-10-14 23:45:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:45:09,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:09,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:09,417 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:09,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-10-14 23:45:09,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:09,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842112961] [2019-10-14 23:45:09,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:09,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:09,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:09,944 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:09,995 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-14 23:45:09,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842112961] [2019-10-14 23:45:09,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:09,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:09,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057628330] [2019-10-14 23:45:09,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:09,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:10,001 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 5 states. [2019-10-14 23:45:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:11,168 INFO L93 Difference]: Finished difference Result 2157 states and 3243 transitions. [2019-10-14 23:45:11,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:11,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:45:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:11,174 INFO L225 Difference]: With dead ends: 2157 [2019-10-14 23:45:11,174 INFO L226 Difference]: Without dead ends: 1016 [2019-10-14 23:45:11,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-14 23:45:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-10-14 23:45:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-10-14 23:45:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-10-14 23:45:11,228 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-10-14 23:45:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:11,228 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-10-14 23:45:11,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-10-14 23:45:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:45:11,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:11,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:11,233 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:11,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-10-14 23:45:11,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:11,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763125311] [2019-10-14 23:45:11,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:11,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:11,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:11,506 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:11,530 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-14 23:45:11,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763125311] [2019-10-14 23:45:11,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:11,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:11,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258442108] [2019-10-14 23:45:11,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:11,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:11,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:11,544 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 4 states. [2019-10-14 23:45:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:13,078 INFO L93 Difference]: Finished difference Result 2291 states and 3531 transitions. [2019-10-14 23:45:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:13,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-14 23:45:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:13,088 INFO L225 Difference]: With dead ends: 2291 [2019-10-14 23:45:13,088 INFO L226 Difference]: Without dead ends: 1464 [2019-10-14 23:45:13,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-10-14 23:45:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-10-14 23:45:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-10-14 23:45:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-10-14 23:45:13,169 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-10-14 23:45:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:13,171 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-10-14 23:45:13,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-10-14 23:45:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:45:13,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:13,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:13,174 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-10-14 23:45:13,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:13,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734781379] [2019-10-14 23:45:13,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:13,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:13,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:13,463 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:13,536 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-14 23:45:13,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734781379] [2019-10-14 23:45:13,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:13,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:13,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178276726] [2019-10-14 23:45:13,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:13,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:13,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:13,539 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 4 states. [2019-10-14 23:45:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:14,808 INFO L93 Difference]: Finished difference Result 3397 states and 5357 transitions. [2019-10-14 23:45:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:14,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-14 23:45:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:14,820 INFO L225 Difference]: With dead ends: 3397 [2019-10-14 23:45:14,820 INFO L226 Difference]: Without dead ends: 2238 [2019-10-14 23:45:14,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-10-14 23:45:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-10-14 23:45:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-14 23:45:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-10-14 23:45:14,919 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-10-14 23:45:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:14,920 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-10-14 23:45:14,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-10-14 23:45:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:45:14,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:14,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:14,922 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-10-14 23:45:14,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:14,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364102225] [2019-10-14 23:45:14,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:14,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:14,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,372 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,435 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-14 23:45:15,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364102225] [2019-10-14 23:45:15,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:15,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:15,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901745651] [2019-10-14 23:45:15,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:15,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:15,441 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 6 states. [2019-10-14 23:45:15,824 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-14 23:45:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:17,041 INFO L93 Difference]: Finished difference Result 4171 states and 6562 transitions. [2019-10-14 23:45:17,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:45:17,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-10-14 23:45:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:17,053 INFO L225 Difference]: With dead ends: 4171 [2019-10-14 23:45:17,053 INFO L226 Difference]: Without dead ends: 2178 [2019-10-14 23:45:17,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-10-14 23:45:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-10-14 23:45:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-14 23:45:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-10-14 23:45:17,167 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-10-14 23:45:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:17,168 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-10-14 23:45:17,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-10-14 23:45:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:45:17,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:17,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:17,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:17,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:17,171 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-10-14 23:45:17,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:17,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851066449] [2019-10-14 23:45:17,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:17,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:17,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:17,616 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:17,646 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-14 23:45:17,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851066449] [2019-10-14 23:45:17,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:17,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:17,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563578643] [2019-10-14 23:45:17,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:17,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:17,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:17,651 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 5 states. [2019-10-14 23:45:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:19,192 INFO L93 Difference]: Finished difference Result 5611 states and 8738 transitions. [2019-10-14 23:45:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:19,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-14 23:45:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:19,209 INFO L225 Difference]: With dead ends: 5611 [2019-10-14 23:45:19,209 INFO L226 Difference]: Without dead ends: 3458 [2019-10-14 23:45:19,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-10-14 23:45:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-10-14 23:45:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-10-14 23:45:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-10-14 23:45:19,381 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-10-14 23:45:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:19,381 INFO L462 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-10-14 23:45:19,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-10-14 23:45:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:45:19,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:19,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:19,384 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:19,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-10-14 23:45:19,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:19,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257076443] [2019-10-14 23:45:19,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:19,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:19,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:19,700 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:19,732 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-14 23:45:19,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257076443] [2019-10-14 23:45:19,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:19,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:19,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824630621] [2019-10-14 23:45:19,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:19,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:19,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:19,735 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 4 states. [2019-10-14 23:45:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:21,474 INFO L93 Difference]: Finished difference Result 9594 states and 14954 transitions. [2019-10-14 23:45:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:21,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-14 23:45:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:21,500 INFO L225 Difference]: With dead ends: 9594 [2019-10-14 23:45:21,501 INFO L226 Difference]: Without dead ends: 6514 [2019-10-14 23:45:21,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-10-14 23:45:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-10-14 23:45:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-10-14 23:45:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-10-14 23:45:21,817 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-10-14 23:45:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:21,818 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-10-14 23:45:21,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-10-14 23:45:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:45:21,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:21,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:21,822 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:21,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-10-14 23:45:21,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:21,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492583548] [2019-10-14 23:45:21,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:21,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:21,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,197 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,222 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-14 23:45:22,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492583548] [2019-10-14 23:45:22,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:22,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:22,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187838569] [2019-10-14 23:45:22,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:22,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:22,225 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 5 states. [2019-10-14 23:45:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:23,211 INFO L93 Difference]: Finished difference Result 10292 states and 15865 transitions. [2019-10-14 23:45:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:23,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-14 23:45:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:23,233 INFO L225 Difference]: With dead ends: 10292 [2019-10-14 23:45:23,233 INFO L226 Difference]: Without dead ends: 5311 [2019-10-14 23:45:23,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-10-14 23:45:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-10-14 23:45:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-10-14 23:45:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-10-14 23:45:23,483 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-10-14 23:45:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:23,484 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-10-14 23:45:23,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-10-14 23:45:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-14 23:45:23,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:23,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:23,487 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-10-14 23:45:23,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:23,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822262030] [2019-10-14 23:45:23,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:23,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:23,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:23,753 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:23,788 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-14 23:45:23,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822262030] [2019-10-14 23:45:23,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:23,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:23,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164796337] [2019-10-14 23:45:23,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:23,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:23,792 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 4 states. [2019-10-14 23:45:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:25,268 INFO L93 Difference]: Finished difference Result 13935 states and 21751 transitions. [2019-10-14 23:45:25,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:25,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-14 23:45:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:25,292 INFO L225 Difference]: With dead ends: 13935 [2019-10-14 23:45:25,292 INFO L226 Difference]: Without dead ends: 8965 [2019-10-14 23:45:25,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-10-14 23:45:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-10-14 23:45:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-10-14 23:45:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-10-14 23:45:25,605 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-10-14 23:45:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:25,605 INFO L462 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-10-14 23:45:25,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-10-14 23:45:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-14 23:45:25,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:25,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:25,609 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-10-14 23:45:25,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:25,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709440999] [2019-10-14 23:45:25,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:25,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:25,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:25,969 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-14 23:45:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:26,026 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-14 23:45:26,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709440999] [2019-10-14 23:45:26,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:26,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:26,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609325669] [2019-10-14 23:45:26,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:26,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:26,030 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 5 states. [2019-10-14 23:45:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:28,195 INFO L93 Difference]: Finished difference Result 24205 states and 37580 transitions. [2019-10-14 23:45:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:28,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-10-14 23:45:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:28,236 INFO L225 Difference]: With dead ends: 24205 [2019-10-14 23:45:28,236 INFO L226 Difference]: Without dead ends: 15565 [2019-10-14 23:45:28,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states.