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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.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-fea9116 [2019-09-20 13:32:05,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:32:05,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:32:05,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:32:05,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:32:05,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:32:05,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:32:05,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:32:05,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:32:05,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:32:05,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:32:05,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:32:05,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:32:05,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:32:05,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:32:05,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:32:05,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:32:05,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:32:05,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:32:05,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:32:05,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:32:05,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:32:05,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:32:05,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:32:05,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:32:05,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:32:05,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:32:05,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:32:05,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:32:05,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:32:05,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:32:05,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:32:05,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:32:05,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:32:05,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:32:05,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:32:05,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:32:05,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:32:05,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:32:05,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:32:05,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:32:05,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:32:05,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:32:05,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:32:05,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:32:05,825 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:32:05,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:32:05,826 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:32:05,826 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:32:05,826 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:32:05,827 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:32:05,827 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:32:05,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:32:05,830 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:32:05,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:32:05,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:32:05,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:32:05,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:32:05,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:32:05,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:32:05,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:32:05,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:32:05,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:32:05,832 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:32:05,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:32:05,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:32:05,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:32:05,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:32:05,833 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:32:05,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:32:05,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:32:05,834 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:32:05,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:32:05,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:32:05,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:32:05,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:32:05,908 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:32:05,909 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-09-20 13:32:05,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723c2347/5dc91466554e41229a35262e18da1054/FLAG74acfb2dd [2019-09-20 13:32:06,557 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:32:06,558 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-09-20 13:32:06,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723c2347/5dc91466554e41229a35262e18da1054/FLAG74acfb2dd [2019-09-20 13:32:06,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723c2347/5dc91466554e41229a35262e18da1054 [2019-09-20 13:32:06,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:32:06,852 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:32:06,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:32:06,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:32:06,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:32:06,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:32:06" (1/1) ... [2019-09-20 13:32:06,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef833d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:06, skipping insertion in model container [2019-09-20 13:32:06,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:32:06" (1/1) ... [2019-09-20 13:32:06,869 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:32:06,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:32:07,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:32:07,552 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:32:07,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:32:07,704 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:32:07,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07 WrapperNode [2019-09-20 13:32:07,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:32:07,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:32:07,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:32:07,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:32:07,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (1/1) ... [2019-09-20 13:32:07,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (1/1) ... [2019-09-20 13:32:07,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (1/1) ... [2019-09-20 13:32:07,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (1/1) ... [2019-09-20 13:32:07,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (1/1) ... [2019-09-20 13:32:07,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (1/1) ... [2019-09-20 13:32:07,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (1/1) ... [2019-09-20 13:32:07,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:32:07,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:32:07,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:32:07,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:32:07,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (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-09-20 13:32:07,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:32:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:32:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:32:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:32:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:32:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-20 13:32:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-20 13:32:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:32:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-20 13:32:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-20 13:32:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-20 13:32:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-20 13:32:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-20 13:32:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-20 13:32:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-20 13:32:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:32:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:32:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:32:09,215 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:32:09,216 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:32:09,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:09 BoogieIcfgContainer [2019-09-20 13:32:09,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:32:09,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:32:09,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:32:09,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:32:09,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:32:06" (1/3) ... [2019-09-20 13:32:09,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6bfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:09, skipping insertion in model container [2019-09-20 13:32:09,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:07" (2/3) ... [2019-09-20 13:32:09,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6bfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:09, skipping insertion in model container [2019-09-20 13:32:09,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:09" (3/3) ... [2019-09-20 13:32:09,226 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-20 13:32:09,237 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:32:09,246 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:32:09,263 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:32:09,291 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:32:09,291 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:32:09,291 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:32:09,291 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:32:09,291 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:32:09,292 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:32:09,292 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:32:09,292 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:32:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-09-20 13:32:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:32:09,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:09,334 INFO L407 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-09-20 13:32:09,336 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-09-20 13:32:09,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:09,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:09,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:09,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:09,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:09,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:09,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:09,923 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 3 states. [2019-09-20 13:32:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:10,085 INFO L93 Difference]: Finished difference Result 370 states and 633 transitions. [2019-09-20 13:32:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:10,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:32:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:10,105 INFO L225 Difference]: With dead ends: 370 [2019-09-20 13:32:10,105 INFO L226 Difference]: Without dead ends: 362 [2019-09-20 13:32:10,107 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-20 13:32:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-09-20 13:32:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:32:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-09-20 13:32:10,198 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-09-20 13:32:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:10,200 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-09-20 13:32:10,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-09-20 13:32:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:32:10,205 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:10,205 INFO L407 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-09-20 13:32:10,205 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:10,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:10,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-09-20 13:32:10,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:10,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:10,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:10,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:10,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:10,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:10,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:10,574 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-09-20 13:32:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:10,699 INFO L93 Difference]: Finished difference Result 691 states and 1039 transitions. [2019-09-20 13:32:10,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:10,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:32:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:10,705 INFO L225 Difference]: With dead ends: 691 [2019-09-20 13:32:10,705 INFO L226 Difference]: Without dead ends: 691 [2019-09-20 13:32:10,706 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-09-20 13:32:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-09-20 13:32:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-20 13:32:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-09-20 13:32:10,742 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-09-20 13:32:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:10,742 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-09-20 13:32:10,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-09-20 13:32:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:10,746 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:10,746 INFO L407 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-09-20 13:32:10,747 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-09-20 13:32:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:10,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:10,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:10,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:10,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:10,840 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 3 states. [2019-09-20 13:32:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:10,867 INFO L93 Difference]: Finished difference Result 1364 states and 2055 transitions. [2019-09-20 13:32:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:10,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-20 13:32:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:10,875 INFO L225 Difference]: With dead ends: 1364 [2019-09-20 13:32:10,876 INFO L226 Difference]: Without dead ends: 1364 [2019-09-20 13:32:10,876 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-20 13:32:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-09-20 13:32:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-20 13:32:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-09-20 13:32:10,906 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-09-20 13:32:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:10,907 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-09-20 13:32:10,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-09-20 13:32:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:32:10,910 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:10,911 INFO L407 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-09-20 13:32:10,911 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:10,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-09-20 13:32:10,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:10,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:11,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:11,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:11,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:11,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:11,075 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 3 states. [2019-09-20 13:32:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:11,138 INFO L93 Difference]: Finished difference Result 1330 states and 1984 transitions. [2019-09-20 13:32:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:11,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-20 13:32:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:11,148 INFO L225 Difference]: With dead ends: 1330 [2019-09-20 13:32:11,148 INFO L226 Difference]: Without dead ends: 1330 [2019-09-20 13:32:11,149 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-09-20 13:32:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-09-20 13:32:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-09-20 13:32:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-09-20 13:32:11,209 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-09-20 13:32:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:11,211 INFO L475 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-09-20 13:32:11,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-09-20 13:32:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:32:11,216 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:11,217 INFO L407 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-09-20 13:32:11,217 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-09-20 13:32:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:11,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:11,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:11,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:11,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:11,496 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 4 states. [2019-09-20 13:32:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:11,544 INFO L93 Difference]: Finished difference Result 1076 states and 1597 transitions. [2019-09-20 13:32:11,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:11,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:32:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:11,552 INFO L225 Difference]: With dead ends: 1076 [2019-09-20 13:32:11,552 INFO L226 Difference]: Without dead ends: 1016 [2019-09-20 13:32:11,553 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-20 13:32:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-09-20 13:32:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-09-20 13:32:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-09-20 13:32:11,594 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-09-20 13:32:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:11,595 INFO L475 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-09-20 13:32:11,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-09-20 13:32:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:32:11,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:11,598 INFO L407 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-09-20 13:32:11,598 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-09-20 13:32:11,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:11,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:11,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:11,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:11,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:11,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:11,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:11,687 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 3 states. [2019-09-20 13:32:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:11,727 INFO L93 Difference]: Finished difference Result 1464 states and 2245 transitions. [2019-09-20 13:32:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:11,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-20 13:32:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:11,736 INFO L225 Difference]: With dead ends: 1464 [2019-09-20 13:32:11,736 INFO L226 Difference]: Without dead ends: 1464 [2019-09-20 13:32:11,736 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-09-20 13:32:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-09-20 13:32:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-09-20 13:32:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-09-20 13:32:11,776 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-09-20 13:32:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:11,777 INFO L475 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-09-20 13:32:11,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-09-20 13:32:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:32:11,779 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:11,780 INFO L407 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-09-20 13:32:11,780 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-09-20 13:32:11,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:11,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:11,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:11,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:11,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:11,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:11,870 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 3 states. [2019-09-20 13:32:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:11,913 INFO L93 Difference]: Finished difference Result 2238 states and 3505 transitions. [2019-09-20 13:32:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:11,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-20 13:32:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:11,925 INFO L225 Difference]: With dead ends: 2238 [2019-09-20 13:32:11,926 INFO L226 Difference]: Without dead ends: 2238 [2019-09-20 13:32:11,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-09-20 13:32:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-09-20 13:32:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-09-20 13:32:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-09-20 13:32:11,989 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-09-20 13:32:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:11,989 INFO L475 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-09-20 13:32:11,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-09-20 13:32:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:32:11,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:11,992 INFO L407 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-09-20 13:32:11,992 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:11,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-09-20 13:32:11,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:12,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-09-20 13:32:12,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:12,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:12,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:12,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:12,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:12,188 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 5 states. [2019-09-20 13:32:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:12,505 INFO L93 Difference]: Finished difference Result 2178 states and 3382 transitions. [2019-09-20 13:32:12,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:12,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-20 13:32:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:12,519 INFO L225 Difference]: With dead ends: 2178 [2019-09-20 13:32:12,520 INFO L226 Difference]: Without dead ends: 2178 [2019-09-20 13:32:12,520 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:32:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-09-20 13:32:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-09-20 13:32:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-09-20 13:32:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-09-20 13:32:12,584 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-09-20 13:32:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:12,584 INFO L475 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-09-20 13:32:12,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-09-20 13:32:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:32:12,587 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:12,587 INFO L407 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-09-20 13:32:12,587 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-09-20 13:32:12,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:12,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:12,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:12,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:12,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:12,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:12,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:12,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:12,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:12,776 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 4 states. [2019-09-20 13:32:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:12,856 INFO L93 Difference]: Finished difference Result 3458 states and 5342 transitions. [2019-09-20 13:32:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:12,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:32:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:12,873 INFO L225 Difference]: With dead ends: 3458 [2019-09-20 13:32:12,873 INFO L226 Difference]: Without dead ends: 3458 [2019-09-20 13:32:12,874 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-09-20 13:32:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-09-20 13:32:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-09-20 13:32:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-09-20 13:32:12,964 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-09-20 13:32:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:12,965 INFO L475 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-09-20 13:32:12,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-09-20 13:32:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:32:12,968 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:12,968 INFO L407 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-09-20 13:32:12,968 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-09-20 13:32:12,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:12,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:12,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:12,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:12,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:13,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:13,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:13,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:13,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:13,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:13,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:13,123 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 3 states. [2019-09-20 13:32:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:13,202 INFO L93 Difference]: Finished difference Result 6514 states and 10017 transitions. [2019-09-20 13:32:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:13,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-20 13:32:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:13,237 INFO L225 Difference]: With dead ends: 6514 [2019-09-20 13:32:13,237 INFO L226 Difference]: Without dead ends: 6514 [2019-09-20 13:32:13,238 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-09-20 13:32:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-09-20 13:32:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-09-20 13:32:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-09-20 13:32:13,383 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-09-20 13:32:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:13,383 INFO L475 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-09-20 13:32:13,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-09-20 13:32:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:32:13,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:13,387 INFO L407 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-09-20 13:32:13,387 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:13,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-09-20 13:32:13,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:13,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:13,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32: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-09-20 13:32:13,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:13,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:13,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:13,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:13,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:13,539 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 4 states. [2019-09-20 13:32:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:13,593 INFO L93 Difference]: Finished difference Result 5359 states and 8199 transitions. [2019-09-20 13:32:13,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:13,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:32:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:13,625 INFO L225 Difference]: With dead ends: 5359 [2019-09-20 13:32:13,626 INFO L226 Difference]: Without dead ends: 5311 [2019-09-20 13:32:13,627 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-09-20 13:32:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-09-20 13:32:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-09-20 13:32:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-09-20 13:32:13,726 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-09-20 13:32:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:13,727 INFO L475 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-09-20 13:32:13,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-09-20 13:32:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:32:13,730 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:13,730 INFO L407 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-09-20 13:32:13,731 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:13,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-09-20 13:32:13,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:13,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:13,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:13,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:13,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:13,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:13,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:13,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:13,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:13,868 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 3 states. [2019-09-20 13:32:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:13,948 INFO L93 Difference]: Finished difference Result 8965 states and 13912 transitions. [2019-09-20 13:32:13,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:13,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-20 13:32:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:13,982 INFO L225 Difference]: With dead ends: 8965 [2019-09-20 13:32:13,982 INFO L226 Difference]: Without dead ends: 8965 [2019-09-20 13:32:13,983 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-09-20 13:32:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-09-20 13:32:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-09-20 13:32:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-09-20 13:32:14,151 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-09-20 13:32:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:14,151 INFO L475 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-09-20 13:32:14,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-09-20 13:32:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:32:14,157 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:14,157 INFO L407 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-09-20 13:32:14,157 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-09-20 13:32:14,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:14,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:14,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:14,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:14,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:14,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:14,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:14,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:14,332 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 4 states. [2019-09-20 13:32:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:14,480 INFO L93 Difference]: Finished difference Result 15565 states and 23929 transitions. [2019-09-20 13:32:14,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:14,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:32:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:14,513 INFO L225 Difference]: With dead ends: 15565 [2019-09-20 13:32:14,513 INFO L226 Difference]: Without dead ends: 15565 [2019-09-20 13:32:14,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2019-09-20 13:32:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15563. [2019-09-20 13:32:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-09-20 13:32:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23928 transitions. [2019-09-20 13:32:15,041 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23928 transitions. Word has length 114 [2019-09-20 13:32:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:15,042 INFO L475 AbstractCegarLoop]: Abstraction has 15563 states and 23928 transitions. [2019-09-20 13:32:15,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23928 transitions. [2019-09-20 13:32:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:32:15,047 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:15,048 INFO L407 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, 1] [2019-09-20 13:32:15,048 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1996953920, now seen corresponding path program 1 times [2019-09-20 13:32:15,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:15,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:15,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:15,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:15,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:15,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:15,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:15,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:15,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:15,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:15,106 INFO L87 Difference]: Start difference. First operand 15563 states and 23928 transitions. Second operand 3 states. [2019-09-20 13:32:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:15,262 INFO L93 Difference]: Finished difference Result 31034 states and 47738 transitions. [2019-09-20 13:32:15,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:15,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-20 13:32:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:15,331 INFO L225 Difference]: With dead ends: 31034 [2019-09-20 13:32:15,332 INFO L226 Difference]: Without dead ends: 31034 [2019-09-20 13:32:15,333 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31034 states. [2019-09-20 13:32:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31034 to 15569. [2019-09-20 13:32:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15569 states. [2019-09-20 13:32:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15569 states to 15569 states and 23934 transitions. [2019-09-20 13:32:16,300 INFO L78 Accepts]: Start accepts. Automaton has 15569 states and 23934 transitions. Word has length 115 [2019-09-20 13:32:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:16,300 INFO L475 AbstractCegarLoop]: Abstraction has 15569 states and 23934 transitions. [2019-09-20 13:32:16,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 15569 states and 23934 transitions. [2019-09-20 13:32:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:32:16,305 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:16,306 INFO L407 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, 1, 1] [2019-09-20 13:32:16,306 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1312027809, now seen corresponding path program 1 times [2019-09-20 13:32:16,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:16,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:16,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:16,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:16,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-09-20 13:32:16,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:16,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:16,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:16,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:16,428 INFO L87 Difference]: Start difference. First operand 15569 states and 23934 transitions. Second operand 4 states. [2019-09-20 13:32:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:16,500 INFO L93 Difference]: Finished difference Result 15754 states and 24150 transitions. [2019-09-20 13:32:16,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:16,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:32:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:16,533 INFO L225 Difference]: With dead ends: 15754 [2019-09-20 13:32:16,533 INFO L226 Difference]: Without dead ends: 15563 [2019-09-20 13:32:16,536 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-09-20 13:32:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15563. [2019-09-20 13:32:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-09-20 13:32:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23922 transitions. [2019-09-20 13:32:16,870 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23922 transitions. Word has length 116 [2019-09-20 13:32:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:16,870 INFO L475 AbstractCegarLoop]: Abstraction has 15563 states and 23922 transitions. [2019-09-20 13:32:16,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23922 transitions. [2019-09-20 13:32:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:32:16,880 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:16,880 INFO L407 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, 1, 1] [2019-09-20 13:32:16,881 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1204434274, now seen corresponding path program 1 times [2019-09-20 13:32:16,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:16,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:17,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:17,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:17,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:17,153 INFO L87 Difference]: Start difference. First operand 15563 states and 23922 transitions. Second operand 3 states. [2019-09-20 13:32:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:17,254 INFO L93 Difference]: Finished difference Result 22487 states and 34048 transitions. [2019-09-20 13:32:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:17,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-20 13:32:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:17,301 INFO L225 Difference]: With dead ends: 22487 [2019-09-20 13:32:17,302 INFO L226 Difference]: Without dead ends: 22487 [2019-09-20 13:32:17,302 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22487 states. [2019-09-20 13:32:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22487 to 22485. [2019-09-20 13:32:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22485 states. [2019-09-20 13:32:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22485 states to 22485 states and 34047 transitions. [2019-09-20 13:32:17,710 INFO L78 Accepts]: Start accepts. Automaton has 22485 states and 34047 transitions. Word has length 116 [2019-09-20 13:32:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:17,711 INFO L475 AbstractCegarLoop]: Abstraction has 22485 states and 34047 transitions. [2019-09-20 13:32:17,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 22485 states and 34047 transitions. [2019-09-20 13:32:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:32:17,718 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:17,718 INFO L407 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, 1, 1, 1, 1, 1] [2019-09-20 13:32:17,718 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash 306834164, now seen corresponding path program 1 times [2019-09-20 13:32:17,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:17,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:17,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:17,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:17,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:17,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:17,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:17,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:17,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:17,823 INFO L87 Difference]: Start difference. First operand 22485 states and 34047 transitions. Second operand 3 states. [2019-09-20 13:32:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:18,146 INFO L93 Difference]: Finished difference Result 42063 states and 63600 transitions. [2019-09-20 13:32:18,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:18,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-20 13:32:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:18,248 INFO L225 Difference]: With dead ends: 42063 [2019-09-20 13:32:18,248 INFO L226 Difference]: Without dead ends: 42063 [2019-09-20 13:32:18,251 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42063 states. [2019-09-20 13:32:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42063 to 41977. [2019-09-20 13:32:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41977 states. [2019-09-20 13:32:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41977 states to 41977 states and 63515 transitions. [2019-09-20 13:32:18,915 INFO L78 Accepts]: Start accepts. Automaton has 41977 states and 63515 transitions. Word has length 119 [2019-09-20 13:32:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:18,916 INFO L475 AbstractCegarLoop]: Abstraction has 41977 states and 63515 transitions. [2019-09-20 13:32:18,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 41977 states and 63515 transitions. [2019-09-20 13:32:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:32:18,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:18,930 INFO L407 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, 1, 1, 1, 1, 1] [2019-09-20 13:32:18,932 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:18,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2137277520, now seen corresponding path program 1 times [2019-09-20 13:32:18,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:18,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:18,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:18,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:18,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:19,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:32:19,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:19,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:32:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:32:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:32:19,498 INFO L87 Difference]: Start difference. First operand 41977 states and 63515 transitions. Second operand 12 states. [2019-09-20 13:32:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:21,052 INFO L93 Difference]: Finished difference Result 117764 states and 179355 transitions. [2019-09-20 13:32:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:32:21,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2019-09-20 13:32:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:21,348 INFO L225 Difference]: With dead ends: 117764 [2019-09-20 13:32:21,348 INFO L226 Difference]: Without dead ends: 117623 [2019-09-20 13:32:21,349 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:32:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117623 states. [2019-09-20 13:32:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117623 to 98909. [2019-09-20 13:32:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98909 states. [2019-09-20 13:32:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98909 states to 98909 states and 150333 transitions. [2019-09-20 13:32:24,167 INFO L78 Accepts]: Start accepts. Automaton has 98909 states and 150333 transitions. Word has length 119 [2019-09-20 13:32:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:24,168 INFO L475 AbstractCegarLoop]: Abstraction has 98909 states and 150333 transitions. [2019-09-20 13:32:24,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:32:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 98909 states and 150333 transitions. [2019-09-20 13:32:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:32:24,177 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:24,177 INFO L407 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, 1, 1, 1, 1, 1] [2019-09-20 13:32:24,177 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1292386507, now seen corresponding path program 1 times [2019-09-20 13:32:24,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:24,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:24,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:24,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:32:24,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:24,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:32:24,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:32:24,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:32:24,395 INFO L87 Difference]: Start difference. First operand 98909 states and 150333 transitions. Second operand 8 states. [2019-09-20 13:32:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:24,816 INFO L93 Difference]: Finished difference Result 98911 states and 150142 transitions. [2019-09-20 13:32:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:24,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 119 [2019-09-20 13:32:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:24,983 INFO L225 Difference]: With dead ends: 98911 [2019-09-20 13:32:24,983 INFO L226 Difference]: Without dead ends: 98911 [2019-09-20 13:32:24,985 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:32:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98911 states. [2019-09-20 13:32:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98911 to 60618. [2019-09-20 13:32:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60618 states. [2019-09-20 13:32:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60618 states to 60618 states and 91446 transitions. [2019-09-20 13:32:27,942 INFO L78 Accepts]: Start accepts. Automaton has 60618 states and 91446 transitions. Word has length 119 [2019-09-20 13:32:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:27,942 INFO L475 AbstractCegarLoop]: Abstraction has 60618 states and 91446 transitions. [2019-09-20 13:32:27,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:32:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60618 states and 91446 transitions. [2019-09-20 13:32:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:32:27,950 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:27,951 INFO L407 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, 1, 1, 1, 1, 1] [2019-09-20 13:32:27,951 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:27,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash 697832963, now seen corresponding path program 1 times [2019-09-20 13:32:27,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:27,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:27,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:28,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:28,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:28,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:28,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:28,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:28,130 INFO L87 Difference]: Start difference. First operand 60618 states and 91446 transitions. Second operand 4 states. [2019-09-20 13:32:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:28,325 INFO L93 Difference]: Finished difference Result 57621 states and 86843 transitions. [2019-09-20 13:32:28,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:28,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-20 13:32:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:28,409 INFO L225 Difference]: With dead ends: 57621 [2019-09-20 13:32:28,409 INFO L226 Difference]: Without dead ends: 57621 [2019-09-20 13:32:28,410 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57621 states. [2019-09-20 13:32:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57621 to 57573. [2019-09-20 13:32:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57573 states. [2019-09-20 13:32:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57573 states to 57573 states and 86788 transitions. [2019-09-20 13:32:29,361 INFO L78 Accepts]: Start accepts. Automaton has 57573 states and 86788 transitions. Word has length 119 [2019-09-20 13:32:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:29,361 INFO L475 AbstractCegarLoop]: Abstraction has 57573 states and 86788 transitions. [2019-09-20 13:32:29,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 57573 states and 86788 transitions. [2019-09-20 13:32:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:32:29,369 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:29,369 INFO L407 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:29,370 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:29,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1649819850, now seen corresponding path program 1 times [2019-09-20 13:32:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:29,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:29,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:29,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:29,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:29,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:29,513 INFO L87 Difference]: Start difference. First operand 57573 states and 86788 transitions. Second operand 4 states. [2019-09-20 13:32:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:29,736 INFO L93 Difference]: Finished difference Result 57815 states and 87057 transitions. [2019-09-20 13:32:29,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:29,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:32:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:29,821 INFO L225 Difference]: With dead ends: 57815 [2019-09-20 13:32:29,821 INFO L226 Difference]: Without dead ends: 57815 [2019-09-20 13:32:29,822 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57815 states. [2019-09-20 13:32:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57815 to 57697. [2019-09-20 13:32:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57697 states. [2019-09-20 13:32:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57697 states to 57697 states and 86916 transitions. [2019-09-20 13:32:30,405 INFO L78 Accepts]: Start accepts. Automaton has 57697 states and 86916 transitions. Word has length 121 [2019-09-20 13:32:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:30,405 INFO L475 AbstractCegarLoop]: Abstraction has 57697 states and 86916 transitions. [2019-09-20 13:32:30,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57697 states and 86916 transitions. [2019-09-20 13:32:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:32:30,413 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:30,413 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:30,413 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash 222930634, now seen corresponding path program 1 times [2019-09-20 13:32:30,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:30,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:30,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:31,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:31,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:31,850 INFO L87 Difference]: Start difference. First operand 57697 states and 86916 transitions. Second operand 3 states. [2019-09-20 13:32:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:32,084 INFO L93 Difference]: Finished difference Result 115180 states and 173580 transitions. [2019-09-20 13:32:32,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:32,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-20 13:32:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:32,227 INFO L225 Difference]: With dead ends: 115180 [2019-09-20 13:32:32,228 INFO L226 Difference]: Without dead ends: 115180 [2019-09-20 13:32:32,228 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:32:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115180 states. [2019-09-20 13:32:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115180 to 57707. [2019-09-20 13:32:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57707 states. [2019-09-20 13:32:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57707 states to 57707 states and 86926 transitions. [2019-09-20 13:32:33,064 INFO L78 Accepts]: Start accepts. Automaton has 57707 states and 86926 transitions. Word has length 122 [2019-09-20 13:32:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:33,064 INFO L475 AbstractCegarLoop]: Abstraction has 57707 states and 86926 transitions. [2019-09-20 13:32:33,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 57707 states and 86926 transitions. [2019-09-20 13:32:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:32:33,070 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:33,070 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:33,070 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash 388091964, now seen corresponding path program 1 times [2019-09-20 13:32:33,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:33,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:33,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:33,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:33,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:33,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:33,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:33,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:33,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:33,203 INFO L87 Difference]: Start difference. First operand 57707 states and 86926 transitions. Second operand 4 states. [2019-09-20 13:32:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:33,580 INFO L93 Difference]: Finished difference Result 58222 states and 87505 transitions. [2019-09-20 13:32:33,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:33,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:32:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:33,670 INFO L225 Difference]: With dead ends: 58222 [2019-09-20 13:32:33,670 INFO L226 Difference]: Without dead ends: 58222 [2019-09-20 13:32:33,671 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58222 states. [2019-09-20 13:32:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58222 to 58001. [2019-09-20 13:32:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58001 states. [2019-09-20 13:32:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58001 states to 58001 states and 87236 transitions. [2019-09-20 13:32:34,314 INFO L78 Accepts]: Start accepts. Automaton has 58001 states and 87236 transitions. Word has length 123 [2019-09-20 13:32:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:34,314 INFO L475 AbstractCegarLoop]: Abstraction has 58001 states and 87236 transitions. [2019-09-20 13:32:34,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 58001 states and 87236 transitions. [2019-09-20 13:32:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:32:34,321 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:34,321 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:34,321 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:34,322 INFO L82 PathProgramCache]: Analyzing trace with hash 52710889, now seen corresponding path program 1 times [2019-09-20 13:32:34,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:34,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:34,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:34,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:34,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:34,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:34,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:34,442 INFO L87 Difference]: Start difference. First operand 58001 states and 87236 transitions. Second operand 4 states. [2019-09-20 13:32:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:34,624 INFO L93 Difference]: Finished difference Result 53379 states and 80238 transitions. [2019-09-20 13:32:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:34,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:32:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:34,713 INFO L225 Difference]: With dead ends: 53379 [2019-09-20 13:32:34,713 INFO L226 Difference]: Without dead ends: 53331 [2019-09-20 13:32:34,719 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53331 states. [2019-09-20 13:32:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53331 to 53328. [2019-09-20 13:32:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53328 states. [2019-09-20 13:32:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53328 states to 53328 states and 80187 transitions. [2019-09-20 13:32:35,509 INFO L78 Accepts]: Start accepts. Automaton has 53328 states and 80187 transitions. Word has length 123 [2019-09-20 13:32:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:35,509 INFO L475 AbstractCegarLoop]: Abstraction has 53328 states and 80187 transitions. [2019-09-20 13:32:35,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 53328 states and 80187 transitions. [2019-09-20 13:32:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:32:35,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:35,514 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:35,514 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 519207877, now seen corresponding path program 1 times [2019-09-20 13:32:35,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:35,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:35,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:35,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:35,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:35,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:35,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:35,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:35,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:35,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:35,646 INFO L87 Difference]: Start difference. First operand 53328 states and 80187 transitions. Second operand 5 states. [2019-09-20 13:32:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:35,961 INFO L93 Difference]: Finished difference Result 53328 states and 79511 transitions. [2019-09-20 13:32:35,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:35,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-20 13:32:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:36,044 INFO L225 Difference]: With dead ends: 53328 [2019-09-20 13:32:36,044 INFO L226 Difference]: Without dead ends: 53328 [2019-09-20 13:32:36,045 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:32:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53328 states. [2019-09-20 13:32:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53328 to 53328. [2019-09-20 13:32:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53328 states.