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_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:14:45,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:14:45,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:14:45,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:14:45,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:14:45,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:14:45,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:14:45,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:14:45,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:14:45,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:14:45,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:14:45,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:14:45,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:14:45,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:14:45,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:14:45,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:14:45,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:14:45,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:14:45,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:14:45,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:14:45,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:14:45,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:14:45,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:14:45,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:14:45,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:14:45,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:14:45,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:14:45,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:14:45,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:14:45,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:14:45,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:14:45,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:14:45,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:14:45,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:14:45,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:14:45,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:14:45,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:14:45,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:14:45,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:14:45,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:14:45,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:14:45,855 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-10 08:14:45,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:14:45,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:14:45,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:14:45,873 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:14:45,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:14:45,874 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:14:45,874 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:14:45,874 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:14:45,874 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:14:45,875 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:14:45,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:14:45,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:14:45,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:14:45,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:14:45,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:14:45,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:14:45,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:14:45,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:14:45,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:14:45,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:14:45,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:14:45,877 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:14:45,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:14:45,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:14:45,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:14:45,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:14:45,878 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:14:45,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:14:45,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:14:45,879 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:14:45,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:14:45,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:14:45,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:14:45,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:14:45,924 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:14:45,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 08:14:45,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0912365f3/764312cea43049648b4d129e8c4ca910/FLAGa1117372a [2019-09-10 08:14:46,551 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:14:46,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 08:14:46,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0912365f3/764312cea43049648b4d129e8c4ca910/FLAGa1117372a [2019-09-10 08:14:46,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0912365f3/764312cea43049648b4d129e8c4ca910 [2019-09-10 08:14:46,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:14:46,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:14:46,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:14:46,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:14:46,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:14:46,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:14:46" (1/1) ... [2019-09-10 08:14:46,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fc21ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:46, skipping insertion in model container [2019-09-10 08:14:46,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:14:46" (1/1) ... [2019-09-10 08:14:46,852 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:14:46,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:14:47,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:14:47,432 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:14:47,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:14:47,609 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:14:47,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47 WrapperNode [2019-09-10 08:14:47,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:14:47,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:14:47,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:14:47,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:14:47,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (1/1) ... [2019-09-10 08:14:47,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (1/1) ... [2019-09-10 08:14:47,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (1/1) ... [2019-09-10 08:14:47,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (1/1) ... [2019-09-10 08:14:47,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (1/1) ... [2019-09-10 08:14:47,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (1/1) ... [2019-09-10 08:14:47,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (1/1) ... [2019-09-10 08:14:47,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:14:47,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:14:47,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:14:47,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:14:47,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (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-10 08:14:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:14:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:14:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:14:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:14:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:14:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:14:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:14:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:14:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:14:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:14:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:14:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:14:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:14:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:14:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:14:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:14:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:14:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:14:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:14:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:14:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:14:49,212 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:14:49,213 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:14:49,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:14:49 BoogieIcfgContainer [2019-09-10 08:14:49,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:14:49,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:14:49,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:14:49,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:14:49,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:14:46" (1/3) ... [2019-09-10 08:14:49,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91ae44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:14:49, skipping insertion in model container [2019-09-10 08:14:49,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:47" (2/3) ... [2019-09-10 08:14:49,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91ae44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:14:49, skipping insertion in model container [2019-09-10 08:14:49,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:14:49" (3/3) ... [2019-09-10 08:14:49,222 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 08:14:49,231 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:14:49,239 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:14:49,256 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:14:49,283 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:14:49,283 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:14:49,284 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:14:49,284 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:14:49,284 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:14:49,284 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:14:49,285 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:14:49,285 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:14:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states. [2019-09-10 08:14:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:14:49,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:49,332 INFO L399 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] [2019-09-10 08:14:49,334 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash 948780422, now seen corresponding path program 1 times [2019-09-10 08:14:49,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:49,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:49,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:49,777 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-10 08:14:49,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:49,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:14:49,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:49,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:14:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:14:49,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:14:49,810 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 4 states. [2019-09-10 08:14:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:49,990 INFO L93 Difference]: Finished difference Result 265 states and 432 transitions. [2019-09-10 08:14:49,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:49,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-10 08:14:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:50,006 INFO L225 Difference]: With dead ends: 265 [2019-09-10 08:14:50,007 INFO L226 Difference]: Without dead ends: 255 [2019-09-10 08:14:50,009 INFO L628 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-10 08:14:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-10 08:14:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-10 08:14:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 08:14:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions. [2019-09-10 08:14:50,065 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 95 [2019-09-10 08:14:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:50,066 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 378 transitions. [2019-09-10 08:14:50,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:14:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions. [2019-09-10 08:14:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:14:50,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:50,073 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:50,073 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2104336594, now seen corresponding path program 1 times [2019-09-10 08:14:50,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:50,310 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-10 08:14:50,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:50,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:50,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:50,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:50,315 INFO L87 Difference]: Start difference. First operand 255 states and 378 transitions. Second operand 3 states. [2019-09-10 08:14:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:50,370 INFO L93 Difference]: Finished difference Result 372 states and 561 transitions. [2019-09-10 08:14:50,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:50,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-09-10 08:14:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:50,375 INFO L225 Difference]: With dead ends: 372 [2019-09-10 08:14:50,375 INFO L226 Difference]: Without dead ends: 372 [2019-09-10 08:14:50,376 INFO L628 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-10 08:14:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-10 08:14:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2019-09-10 08:14:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-10 08:14:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 560 transitions. [2019-09-10 08:14:50,415 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 560 transitions. Word has length 134 [2019-09-10 08:14:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:50,416 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 560 transitions. [2019-09-10 08:14:50,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 560 transitions. [2019-09-10 08:14:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:14:50,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:50,428 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:50,428 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1055745023, now seen corresponding path program 1 times [2019-09-10 08:14:50,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:50,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:50,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:50,617 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-10 08:14:50,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:50,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:50,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:50,619 INFO L87 Difference]: Start difference. First operand 370 states and 560 transitions. Second operand 3 states. [2019-09-10 08:14:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:50,654 INFO L93 Difference]: Finished difference Result 578 states and 887 transitions. [2019-09-10 08:14:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:50,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:14:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:50,658 INFO L225 Difference]: With dead ends: 578 [2019-09-10 08:14:50,658 INFO L226 Difference]: Without dead ends: 578 [2019-09-10 08:14:50,659 INFO L628 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-10 08:14:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-10 08:14:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2019-09-10 08:14:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 08:14:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2019-09-10 08:14:50,689 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 136 [2019-09-10 08:14:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:50,689 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2019-09-10 08:14:50,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2019-09-10 08:14:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:14:50,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:50,693 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:50,693 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1892333628, now seen corresponding path program 1 times [2019-09-10 08:14:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:50,863 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-10 08:14:50,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:50,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:50,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:50,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:50,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:50,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:50,866 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand 3 states. [2019-09-10 08:14:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:50,914 INFO L93 Difference]: Finished difference Result 938 states and 1455 transitions. [2019-09-10 08:14:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:50,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:14:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:50,923 INFO L225 Difference]: With dead ends: 938 [2019-09-10 08:14:50,924 INFO L226 Difference]: Without dead ends: 938 [2019-09-10 08:14:50,924 INFO L628 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-10 08:14:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-10 08:14:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 936. [2019-09-10 08:14:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-09-10 08:14:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1454 transitions. [2019-09-10 08:14:50,954 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1454 transitions. Word has length 138 [2019-09-10 08:14:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:50,955 INFO L475 AbstractCegarLoop]: Abstraction has 936 states and 1454 transitions. [2019-09-10 08:14:50,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1454 transitions. [2019-09-10 08:14:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:14:50,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:50,959 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:50,959 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash -92485214, now seen corresponding path program 1 times [2019-09-10 08:14:50,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:50,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:51,084 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-10 08:14:51,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:51,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:51,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:51,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:51,087 INFO L87 Difference]: Start difference. First operand 936 states and 1454 transitions. Second operand 3 states. [2019-09-10 08:14:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:51,132 INFO L93 Difference]: Finished difference Result 1550 states and 2415 transitions. [2019-09-10 08:14:51,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:51,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 08:14:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:51,142 INFO L225 Difference]: With dead ends: 1550 [2019-09-10 08:14:51,143 INFO L226 Difference]: Without dead ends: 1550 [2019-09-10 08:14:51,143 INFO L628 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-10 08:14:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2019-09-10 08:14:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1548. [2019-09-10 08:14:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-09-10 08:14:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2414 transitions. [2019-09-10 08:14:51,199 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2414 transitions. Word has length 140 [2019-09-10 08:14:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:51,199 INFO L475 AbstractCegarLoop]: Abstraction has 1548 states and 2414 transitions. [2019-09-10 08:14:51,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2414 transitions. [2019-09-10 08:14:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:14:51,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:51,205 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:51,205 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1568530186, now seen corresponding path program 1 times [2019-09-10 08:14:51,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:51,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:51,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:51,313 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-10 08:14:51,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:51,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:51,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:51,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:51,316 INFO L87 Difference]: Start difference. First operand 1548 states and 2414 transitions. Second operand 3 states. [2019-09-10 08:14:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:51,364 INFO L93 Difference]: Finished difference Result 2554 states and 3975 transitions. [2019-09-10 08:14:51,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:51,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 08:14:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:51,381 INFO L225 Difference]: With dead ends: 2554 [2019-09-10 08:14:51,381 INFO L226 Difference]: Without dead ends: 2554 [2019-09-10 08:14:51,381 INFO L628 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-10 08:14:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2019-09-10 08:14:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2019-09-10 08:14:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2552 states. [2019-09-10 08:14:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3974 transitions. [2019-09-10 08:14:51,464 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3974 transitions. Word has length 142 [2019-09-10 08:14:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:51,466 INFO L475 AbstractCegarLoop]: Abstraction has 2552 states and 3974 transitions. [2019-09-10 08:14:51,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3974 transitions. [2019-09-10 08:14:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:14:51,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:51,478 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:51,483 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:51,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:51,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2081311946, now seen corresponding path program 1 times [2019-09-10 08:14:51,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:51,600 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-10 08:14:51,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:51,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:51,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:51,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:51,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:51,603 INFO L87 Difference]: Start difference. First operand 2552 states and 3974 transitions. Second operand 3 states. [2019-09-10 08:14:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:51,678 INFO L93 Difference]: Finished difference Result 4118 states and 6367 transitions. [2019-09-10 08:14:51,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:51,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:14:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:51,706 INFO L225 Difference]: With dead ends: 4118 [2019-09-10 08:14:51,706 INFO L226 Difference]: Without dead ends: 4118 [2019-09-10 08:14:51,707 INFO L628 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-10 08:14:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2019-09-10 08:14:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 4116. [2019-09-10 08:14:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-09-10 08:14:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 6366 transitions. [2019-09-10 08:14:51,884 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 6366 transitions. Word has length 144 [2019-09-10 08:14:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:51,885 INFO L475 AbstractCegarLoop]: Abstraction has 4116 states and 6366 transitions. [2019-09-10 08:14:51,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 6366 transitions. [2019-09-10 08:14:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:14:51,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:51,904 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:51,905 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -638569554, now seen corresponding path program 1 times [2019-09-10 08:14:51,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:51,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:52,032 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-10 08:14:52,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:52,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:52,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:52,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:52,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:52,035 INFO L87 Difference]: Start difference. First operand 4116 states and 6366 transitions. Second operand 3 states. [2019-09-10 08:14:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:52,443 INFO L93 Difference]: Finished difference Result 8132 states and 12554 transitions. [2019-09-10 08:14:52,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:52,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:14:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:52,488 INFO L225 Difference]: With dead ends: 8132 [2019-09-10 08:14:52,488 INFO L226 Difference]: Without dead ends: 8132 [2019-09-10 08:14:52,489 INFO L628 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-10 08:14:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8132 states. [2019-09-10 08:14:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8132 to 8130. [2019-09-10 08:14:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8130 states. [2019-09-10 08:14:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8130 states to 8130 states and 12553 transitions. [2019-09-10 08:14:52,723 INFO L78 Accepts]: Start accepts. Automaton has 8130 states and 12553 transitions. Word has length 146 [2019-09-10 08:14:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:52,723 INFO L475 AbstractCegarLoop]: Abstraction has 8130 states and 12553 transitions. [2019-09-10 08:14:52,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8130 states and 12553 transitions. [2019-09-10 08:14:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:14:52,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:52,748 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:52,748 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash -24546701, now seen corresponding path program 1 times [2019-09-10 08:14:52,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:52,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:52,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:52,923 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-10 08:14:52,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:52,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:52,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:52,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:52,927 INFO L87 Difference]: Start difference. First operand 8130 states and 12553 transitions. Second operand 3 states. [2019-09-10 08:14:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:53,329 INFO L93 Difference]: Finished difference Result 16104 states and 24780 transitions. [2019-09-10 08:14:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:53,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:14:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:53,384 INFO L225 Difference]: With dead ends: 16104 [2019-09-10 08:14:53,384 INFO L226 Difference]: Without dead ends: 16104 [2019-09-10 08:14:53,384 INFO L628 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-10 08:14:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-09-10 08:14:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16102. [2019-09-10 08:14:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-10 08:14:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 24779 transitions. [2019-09-10 08:14:53,847 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 24779 transitions. Word has length 146 [2019-09-10 08:14:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:53,847 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 24779 transitions. [2019-09-10 08:14:53,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 24779 transitions. [2019-09-10 08:14:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:14:53,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:53,888 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:53,888 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:53,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1040738216, now seen corresponding path program 1 times [2019-09-10 08:14:53,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:53,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:53,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:53,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:53,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:54,000 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-10 08:14:54,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:54,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:54,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:54,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:54,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:54,005 INFO L87 Difference]: Start difference. First operand 16102 states and 24779 transitions. Second operand 3 states. [2019-09-10 08:14:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:54,385 INFO L93 Difference]: Finished difference Result 32010 states and 49088 transitions. [2019-09-10 08:14:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:54,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:14:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:54,458 INFO L225 Difference]: With dead ends: 32010 [2019-09-10 08:14:54,458 INFO L226 Difference]: Without dead ends: 32010 [2019-09-10 08:14:54,459 INFO L628 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-10 08:14:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32010 states. [2019-09-10 08:14:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32010 to 32008. [2019-09-10 08:14:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32008 states. [2019-09-10 08:14:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32008 states to 32008 states and 49087 transitions. [2019-09-10 08:14:55,614 INFO L78 Accepts]: Start accepts. Automaton has 32008 states and 49087 transitions. Word has length 146 [2019-09-10 08:14:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:55,614 INFO L475 AbstractCegarLoop]: Abstraction has 32008 states and 49087 transitions. [2019-09-10 08:14:55,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 32008 states and 49087 transitions. [2019-09-10 08:14:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:14:55,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:55,693 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:55,693 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1803601923, now seen corresponding path program 1 times [2019-09-10 08:14:55,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:55,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:55,838 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-10 08:14:55,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:55,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:55,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:55,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:55,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:55,840 INFO L87 Difference]: Start difference. First operand 32008 states and 49087 transitions. Second operand 5 states. [2019-09-10 08:14:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:56,310 INFO L93 Difference]: Finished difference Result 32008 states and 48822 transitions. [2019-09-10 08:14:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:56,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-10 08:14:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:56,375 INFO L225 Difference]: With dead ends: 32008 [2019-09-10 08:14:56,375 INFO L226 Difference]: Without dead ends: 32008 [2019-09-10 08:14:56,376 INFO L628 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-10 08:14:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32008 states. [2019-09-10 08:14:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32008 to 32008. [2019-09-10 08:14:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32008 states. [2019-09-10 08:14:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32008 states to 32008 states and 48822 transitions. [2019-09-10 08:14:56,841 INFO L78 Accepts]: Start accepts. Automaton has 32008 states and 48822 transitions. Word has length 146 [2019-09-10 08:14:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:56,842 INFO L475 AbstractCegarLoop]: Abstraction has 32008 states and 48822 transitions. [2019-09-10 08:14:56,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 32008 states and 48822 transitions. [2019-09-10 08:14:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:14:56,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:56,884 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:56,884 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1070960903, now seen corresponding path program 1 times [2019-09-10 08:14:56,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:56,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:56,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:56,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:56,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:57,039 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-10 08:14:57,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:57,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:57,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:57,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:57,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:57,042 INFO L87 Difference]: Start difference. First operand 32008 states and 48822 transitions. Second operand 5 states. [2019-09-10 08:14:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:57,670 INFO L93 Difference]: Finished difference Result 32008 states and 48430 transitions. [2019-09-10 08:14:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:57,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-10 08:14:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:57,747 INFO L225 Difference]: With dead ends: 32008 [2019-09-10 08:14:57,747 INFO L226 Difference]: Without dead ends: 32008 [2019-09-10 08:14:57,748 INFO L628 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-10 08:14:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32008 states. [2019-09-10 08:14:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32008 to 32008. [2019-09-10 08:14:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32008 states. [2019-09-10 08:14:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32008 states to 32008 states and 48430 transitions. [2019-09-10 08:14:58,231 INFO L78 Accepts]: Start accepts. Automaton has 32008 states and 48430 transitions. Word has length 146 [2019-09-10 08:14:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:58,232 INFO L475 AbstractCegarLoop]: Abstraction has 32008 states and 48430 transitions. [2019-09-10 08:14:58,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32008 states and 48430 transitions. [2019-09-10 08:14:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:14:58,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:58,273 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:58,274 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash -990480985, now seen corresponding path program 1 times [2019-09-10 08:14:58,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:58,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:58,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:58,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:58,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:58,441 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-10 08:14:58,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:58,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:58,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:58,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:58,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:58,443 INFO L87 Difference]: Start difference. First operand 32008 states and 48430 transitions. Second operand 5 states. [2019-09-10 08:14:58,984 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-10 08:14:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:59,284 INFO L93 Difference]: Finished difference Result 16112 states and 24324 transitions. [2019-09-10 08:14:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:59,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-10 08:14:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:59,312 INFO L225 Difference]: With dead ends: 16112 [2019-09-10 08:14:59,312 INFO L226 Difference]: Without dead ends: 16112 [2019-09-10 08:14:59,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:14:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16112 states. [2019-09-10 08:14:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16112 to 16112. [2019-09-10 08:14:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16112 states. [2019-09-10 08:14:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16112 states to 16112 states and 24324 transitions. [2019-09-10 08:14:59,548 INFO L78 Accepts]: Start accepts. Automaton has 16112 states and 24324 transitions. Word has length 146 [2019-09-10 08:14:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:59,548 INFO L475 AbstractCegarLoop]: Abstraction has 16112 states and 24324 transitions. [2019-09-10 08:14:59,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 16112 states and 24324 transitions. [2019-09-10 08:14:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:14:59,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:59,568 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:59,568 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:59,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1390725383, now seen corresponding path program 1 times [2019-09-10 08:14:59,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:59,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:59,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:59,733 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-10 08:14:59,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:59,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:59,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:59,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:59,736 INFO L87 Difference]: Start difference. First operand 16112 states and 24324 transitions. Second operand 3 states. [2019-09-10 08:14:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:59,812 INFO L93 Difference]: Finished difference Result 14018 states and 20853 transitions. [2019-09-10 08:14:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:59,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:14:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:59,831 INFO L225 Difference]: With dead ends: 14018 [2019-09-10 08:14:59,832 INFO L226 Difference]: Without dead ends: 14018 [2019-09-10 08:14:59,833 INFO L628 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-10 08:14:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2019-09-10 08:14:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 14016. [2019-09-10 08:14:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14016 states. [2019-09-10 08:15:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14016 states to 14016 states and 20852 transitions. [2019-09-10 08:15:00,013 INFO L78 Accepts]: Start accepts. Automaton has 14016 states and 20852 transitions. Word has length 146 [2019-09-10 08:15:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:00,013 INFO L475 AbstractCegarLoop]: Abstraction has 14016 states and 20852 transitions. [2019-09-10 08:15:00,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:00,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14016 states and 20852 transitions. [2019-09-10 08:15:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:15:00,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:00,025 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:00,025 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash -227357900, now seen corresponding path program 1 times [2019-09-10 08:15:00,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:00,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:00,133 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-10 08:15:00,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:00,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:00,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:00,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:00,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:00,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:00,134 INFO L87 Difference]: Start difference. First operand 14016 states and 20852 transitions. Second operand 3 states. [2019-09-10 08:15:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:00,170 INFO L93 Difference]: Finished difference Result 7100 states and 10475 transitions. [2019-09-10 08:15:00,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:00,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:15:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:00,181 INFO L225 Difference]: With dead ends: 7100 [2019-09-10 08:15:00,182 INFO L226 Difference]: Without dead ends: 7100 [2019-09-10 08:15:00,184 INFO L628 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-10 08:15:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7100 states. [2019-09-10 08:15:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7100 to 7098. [2019-09-10 08:15:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7098 states. [2019-09-10 08:15:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7098 states to 7098 states and 10474 transitions. [2019-09-10 08:15:00,263 INFO L78 Accepts]: Start accepts. Automaton has 7098 states and 10474 transitions. Word has length 146 [2019-09-10 08:15:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:00,264 INFO L475 AbstractCegarLoop]: Abstraction has 7098 states and 10474 transitions. [2019-09-10 08:15:00,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 7098 states and 10474 transitions. [2019-09-10 08:15:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:15:00,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:00,269 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:00,270 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2122099427, now seen corresponding path program 1 times [2019-09-10 08:15:00,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:00,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:00,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:00,614 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-10 08:15:00,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:00,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:00,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:00,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:00,617 INFO L87 Difference]: Start difference. First operand 7098 states and 10474 transitions. Second operand 8 states. [2019-09-10 08:15:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:01,219 INFO L93 Difference]: Finished difference Result 62970 states and 91289 transitions. [2019-09-10 08:15:01,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:15:01,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2019-09-10 08:15:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:01,310 INFO L225 Difference]: With dead ends: 62970 [2019-09-10 08:15:01,310 INFO L226 Difference]: Without dead ends: 62970 [2019-09-10 08:15:01,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:15:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62970 states. [2019-09-10 08:15:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62970 to 20756. [2019-09-10 08:15:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20756 states. [2019-09-10 08:15:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20756 states to 20756 states and 30304 transitions. [2019-09-10 08:15:01,847 INFO L78 Accepts]: Start accepts. Automaton has 20756 states and 30304 transitions. Word has length 146 [2019-09-10 08:15:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:01,847 INFO L475 AbstractCegarLoop]: Abstraction has 20756 states and 30304 transitions. [2019-09-10 08:15:01,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 20756 states and 30304 transitions. [2019-09-10 08:15:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:15:01,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:01,866 INFO L399 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, 1, 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-10 08:15:01,867 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1604732671, now seen corresponding path program 1 times [2019-09-10 08:15:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:01,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:01,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:01,961 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-10 08:15:01,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:01,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:01,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:01,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:01,963 INFO L87 Difference]: Start difference. First operand 20756 states and 30304 transitions. Second operand 3 states. [2019-09-10 08:15:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:02,046 INFO L93 Difference]: Finished difference Result 20752 states and 30292 transitions. [2019-09-10 08:15:02,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:02,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 08:15:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:02,188 INFO L225 Difference]: With dead ends: 20752 [2019-09-10 08:15:02,188 INFO L226 Difference]: Without dead ends: 20752 [2019-09-10 08:15:02,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20752 states. [2019-09-10 08:15:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20752 to 20752. [2019-09-10 08:15:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20752 states. [2019-09-10 08:15:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20752 states to 20752 states and 30292 transitions. [2019-09-10 08:15:02,434 INFO L78 Accepts]: Start accepts. Automaton has 20752 states and 30292 transitions. Word has length 150 [2019-09-10 08:15:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:02,435 INFO L475 AbstractCegarLoop]: Abstraction has 20752 states and 30292 transitions. [2019-09-10 08:15:02,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20752 states and 30292 transitions. [2019-09-10 08:15:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:15:02,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:02,451 INFO L399 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, 1, 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-10 08:15:02,451 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1663507810, now seen corresponding path program 1 times [2019-09-10 08:15:02,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:02,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:02,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:02,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:02,554 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-10 08:15:02,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:02,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:02,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:02,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:02,556 INFO L87 Difference]: Start difference. First operand 20752 states and 30292 transitions. Second operand 3 states. [2019-09-10 08:15:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:02,600 INFO L93 Difference]: Finished difference Result 10554 states and 15285 transitions. [2019-09-10 08:15:02,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:02,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 08:15:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:02,613 INFO L225 Difference]: With dead ends: 10554 [2019-09-10 08:15:02,613 INFO L226 Difference]: Without dead ends: 10554 [2019-09-10 08:15:02,614 INFO L628 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-10 08:15:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2019-09-10 08:15:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 10552. [2019-09-10 08:15:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10552 states. [2019-09-10 08:15:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10552 states to 10552 states and 15284 transitions. [2019-09-10 08:15:02,724 INFO L78 Accepts]: Start accepts. Automaton has 10552 states and 15284 transitions. Word has length 150 [2019-09-10 08:15:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:02,724 INFO L475 AbstractCegarLoop]: Abstraction has 10552 states and 15284 transitions. [2019-09-10 08:15:02,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 10552 states and 15284 transitions. [2019-09-10 08:15:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:15:02,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:02,732 INFO L399 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, 1, 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-10 08:15:02,733 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:02,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:02,733 INFO L82 PathProgramCache]: Analyzing trace with hash 220267747, now seen corresponding path program 1 times [2019-09-10 08:15:02,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:02,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:02,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:02,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:02,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:02,928 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-10 08:15:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:02,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:02,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:02,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:02,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:02,930 INFO L87 Difference]: Start difference. First operand 10552 states and 15284 transitions. Second operand 8 states. [2019-09-10 08:15:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:03,467 INFO L93 Difference]: Finished difference Result 46996 states and 67674 transitions. [2019-09-10 08:15:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:03,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-10 08:15:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:03,524 INFO L225 Difference]: With dead ends: 46996 [2019-09-10 08:15:03,524 INFO L226 Difference]: Without dead ends: 46996 [2019-09-10 08:15:03,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:15:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46996 states. [2019-09-10 08:15:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46996 to 16676. [2019-09-10 08:15:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16676 states. [2019-09-10 08:15:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16676 states to 16676 states and 23964 transitions. [2019-09-10 08:15:03,859 INFO L78 Accepts]: Start accepts. Automaton has 16676 states and 23964 transitions. Word has length 150 [2019-09-10 08:15:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:03,860 INFO L475 AbstractCegarLoop]: Abstraction has 16676 states and 23964 transitions. [2019-09-10 08:15:03,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 16676 states and 23964 transitions. [2019-09-10 08:15:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:15:03,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:03,874 INFO L399 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, 1, 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-10 08:15:03,874 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash -703606179, now seen corresponding path program 1 times [2019-09-10 08:15:03,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:03,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:04,194 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-10 08:15:04,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:04,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:04,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:04,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:04,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:04,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:04,197 INFO L87 Difference]: Start difference. First operand 16676 states and 23964 transitions. Second operand 8 states. [2019-09-10 08:15:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:04,628 INFO L93 Difference]: Finished difference Result 38044 states and 54546 transitions. [2019-09-10 08:15:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:04,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-10 08:15:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:04,672 INFO L225 Difference]: With dead ends: 38044 [2019-09-10 08:15:04,673 INFO L226 Difference]: Without dead ends: 38044 [2019-09-10 08:15:04,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38044 states. [2019-09-10 08:15:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38044 to 23004. [2019-09-10 08:15:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23004 states. [2019-09-10 08:15:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23004 states to 23004 states and 32956 transitions. [2019-09-10 08:15:04,992 INFO L78 Accepts]: Start accepts. Automaton has 23004 states and 32956 transitions. Word has length 150 [2019-09-10 08:15:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:04,993 INFO L475 AbstractCegarLoop]: Abstraction has 23004 states and 32956 transitions. [2019-09-10 08:15:04,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23004 states and 32956 transitions. [2019-09-10 08:15:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:15:05,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:05,003 INFO L399 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, 1, 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-10 08:15:05,004 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1833502417, now seen corresponding path program 1 times [2019-09-10 08:15:05,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:05,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:05,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:05,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:05,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:05,364 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-10 08:15:05,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:05,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:05,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:05,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:05,366 INFO L87 Difference]: Start difference. First operand 23004 states and 32956 transitions. Second operand 8 states. [2019-09-10 08:15:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:05,743 INFO L93 Difference]: Finished difference Result 26134 states and 37295 transitions. [2019-09-10 08:15:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:05,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-10 08:15:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:05,780 INFO L225 Difference]: With dead ends: 26134 [2019-09-10 08:15:05,781 INFO L226 Difference]: Without dead ends: 26134 [2019-09-10 08:15:05,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:15:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26134 states. [2019-09-10 08:15:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26134 to 23004. [2019-09-10 08:15:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23004 states. [2019-09-10 08:15:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23004 states to 23004 states and 32728 transitions. [2019-09-10 08:15:06,125 INFO L78 Accepts]: Start accepts. Automaton has 23004 states and 32728 transitions. Word has length 150 [2019-09-10 08:15:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:06,125 INFO L475 AbstractCegarLoop]: Abstraction has 23004 states and 32728 transitions. [2019-09-10 08:15:06,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 23004 states and 32728 transitions. [2019-09-10 08:15:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:15:06,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:06,141 INFO L399 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, 1, 1, 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-10 08:15:06,144 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:06,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1274348331, now seen corresponding path program 1 times [2019-09-10 08:15:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:06,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:06,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:06,454 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-10 08:15:06,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:06,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:06,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:06,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:06,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:06,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:06,456 INFO L87 Difference]: Start difference. First operand 23004 states and 32728 transitions. Second operand 5 states. [2019-09-10 08:15:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:06,683 INFO L93 Difference]: Finished difference Result 37720 states and 53682 transitions. [2019-09-10 08:15:06,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:06,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-10 08:15:06,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:06,720 INFO L225 Difference]: With dead ends: 37720 [2019-09-10 08:15:06,720 INFO L226 Difference]: Without dead ends: 37720 [2019-09-10 08:15:06,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:15:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37720 states. [2019-09-10 08:15:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37720 to 34804. [2019-09-10 08:15:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34804 states. [2019-09-10 08:15:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34804 states to 34804 states and 49664 transitions. [2019-09-10 08:15:07,055 INFO L78 Accepts]: Start accepts. Automaton has 34804 states and 49664 transitions. Word has length 151 [2019-09-10 08:15:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:07,055 INFO L475 AbstractCegarLoop]: Abstraction has 34804 states and 49664 transitions. [2019-09-10 08:15:07,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34804 states and 49664 transitions. [2019-09-10 08:15:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:15:07,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:07,069 INFO L399 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, 1, 1, 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-10 08:15:07,069 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash 247030735, now seen corresponding path program 1 times [2019-09-10 08:15:07,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:07,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:07,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:07,269 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-10 08:15:07,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:07,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:07,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:07,271 INFO L87 Difference]: Start difference. First operand 34804 states and 49664 transitions. Second operand 8 states. [2019-09-10 08:15:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:07,757 INFO L93 Difference]: Finished difference Result 67484 states and 96254 transitions. [2019-09-10 08:15:07,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:07,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2019-09-10 08:15:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:07,839 INFO L225 Difference]: With dead ends: 67484 [2019-09-10 08:15:07,839 INFO L226 Difference]: Without dead ends: 67484 [2019-09-10 08:15:07,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67484 states. [2019-09-10 08:15:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67484 to 40708. [2019-09-10 08:15:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40708 states. [2019-09-10 08:15:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40708 states to 40708 states and 57952 transitions. [2019-09-10 08:15:09,582 INFO L78 Accepts]: Start accepts. Automaton has 40708 states and 57952 transitions. Word has length 151 [2019-09-10 08:15:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:09,582 INFO L475 AbstractCegarLoop]: Abstraction has 40708 states and 57952 transitions. [2019-09-10 08:15:09,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 40708 states and 57952 transitions. [2019-09-10 08:15:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:15:09,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:09,598 INFO L399 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, 1, 1, 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-10 08:15:09,598 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1556684379, now seen corresponding path program 1 times [2019-09-10 08:15:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:09,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:09,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:09,839 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-10 08:15:09,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:09,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:09,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:09,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:09,844 INFO L87 Difference]: Start difference. First operand 40708 states and 57952 transitions. Second operand 8 states. [2019-09-10 08:15:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:10,372 INFO L93 Difference]: Finished difference Result 70660 states and 100658 transitions. [2019-09-10 08:15:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:10,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2019-09-10 08:15:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:10,447 INFO L225 Difference]: With dead ends: 70660 [2019-09-10 08:15:10,447 INFO L226 Difference]: Without dead ends: 70660 [2019-09-10 08:15:10,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:15:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70660 states. [2019-09-10 08:15:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70660 to 47036. [2019-09-10 08:15:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47036 states. [2019-09-10 08:15:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47036 states to 47036 states and 66880 transitions. [2019-09-10 08:15:10,979 INFO L78 Accepts]: Start accepts. Automaton has 47036 states and 66880 transitions. Word has length 151 [2019-09-10 08:15:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:10,979 INFO L475 AbstractCegarLoop]: Abstraction has 47036 states and 66880 transitions. [2019-09-10 08:15:10,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 47036 states and 66880 transitions. [2019-09-10 08:15:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:15:11,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,003 INFO L399 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, 1, 1, 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-10 08:15:11,003 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1301984749, now seen corresponding path program 1 times [2019-09-10 08:15:11,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:11,130 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-10 08:15:11,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:11,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:11,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:11,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:11,132 INFO L87 Difference]: Start difference. First operand 47036 states and 66880 transitions. Second operand 5 states. [2019-09-10 08:15:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:11,403 INFO L93 Difference]: Finished difference Result 56288 states and 80142 transitions. [2019-09-10 08:15:11,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:11,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-10 08:15:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:11,475 INFO L225 Difference]: With dead ends: 56288 [2019-09-10 08:15:11,475 INFO L226 Difference]: Without dead ends: 56288 [2019-09-10 08:15:11,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:15:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56288 states. [2019-09-10 08:15:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56288 to 53436. [2019-09-10 08:15:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53436 states. [2019-09-10 08:15:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53436 states to 53436 states and 76076 transitions. [2019-09-10 08:15:12,277 INFO L78 Accepts]: Start accepts. Automaton has 53436 states and 76076 transitions. Word has length 151 [2019-09-10 08:15:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:12,277 INFO L475 AbstractCegarLoop]: Abstraction has 53436 states and 76076 transitions. [2019-09-10 08:15:12,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53436 states and 76076 transitions. [2019-09-10 08:15:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:15:12,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:12,301 INFO L399 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, 1, 1, 1, 1, 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-10 08:15:12,301 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1710125902, now seen corresponding path program 1 times [2019-09-10 08:15:12,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:12,587 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-10 08:15:12,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:12,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:15:12,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:12,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:15:12,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:15:12,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:15:12,589 INFO L87 Difference]: Start difference. First operand 53436 states and 76076 transitions. Second operand 10 states. [2019-09-10 08:15:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:17,804 INFO L93 Difference]: Finished difference Result 459978 states and 648206 transitions. [2019-09-10 08:15:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:15:17,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-10 08:15:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:18,365 INFO L225 Difference]: With dead ends: 459978 [2019-09-10 08:15:18,365 INFO L226 Difference]: Without dead ends: 459978 [2019-09-10 08:15:18,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:15:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459978 states. [2019-09-10 08:15:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459978 to 103256. [2019-09-10 08:15:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103256 states. [2019-09-10 08:15:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103256 states to 103256 states and 146036 transitions. [2019-09-10 08:15:21,143 INFO L78 Accepts]: Start accepts. Automaton has 103256 states and 146036 transitions. Word has length 153 [2019-09-10 08:15:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:21,143 INFO L475 AbstractCegarLoop]: Abstraction has 103256 states and 146036 transitions. [2019-09-10 08:15:21,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:15:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 103256 states and 146036 transitions. [2019-09-10 08:15:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:15:21,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:21,175 INFO L399 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, 1, 1, 1, 1, 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-10 08:15:21,175 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1003999422, now seen corresponding path program 1 times [2019-09-10 08:15:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:21,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:21,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:21,488 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-10 08:15:21,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:21,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:15:21,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:21,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:15:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:15:21,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:15:21,490 INFO L87 Difference]: Start difference. First operand 103256 states and 146036 transitions. Second operand 10 states. [2019-09-10 08:15:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:27,168 INFO L93 Difference]: Finished difference Result 669975 states and 942580 transitions. [2019-09-10 08:15:27,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:15:27,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-10 08:15:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:28,056 INFO L225 Difference]: With dead ends: 669975 [2019-09-10 08:15:28,056 INFO L226 Difference]: Without dead ends: 669975 [2019-09-10 08:15:28,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:15:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669975 states. [2019-09-10 08:15:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669975 to 101669. [2019-09-10 08:15:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101669 states. [2019-09-10 08:15:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101669 states to 101669 states and 143686 transitions. [2019-09-10 08:15:32,281 INFO L78 Accepts]: Start accepts. Automaton has 101669 states and 143686 transitions. Word has length 153 [2019-09-10 08:15:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:32,281 INFO L475 AbstractCegarLoop]: Abstraction has 101669 states and 143686 transitions. [2019-09-10 08:15:32,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:15:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 101669 states and 143686 transitions. [2019-09-10 08:15:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:15:32,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:32,312 INFO L399 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, 1, 1, 1, 1, 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-10 08:15:32,312 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash 80125496, now seen corresponding path program 1 times [2019-09-10 08:15:32,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:32,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:32,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:32,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:32,588 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-10 08:15:32,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:32,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:15:32,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:32,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:15:32,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:15:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:15:32,590 INFO L87 Difference]: Start difference. First operand 101669 states and 143686 transitions. Second operand 10 states. [2019-09-10 08:15:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:37,509 INFO L93 Difference]: Finished difference Result 802137 states and 1129582 transitions. [2019-09-10 08:15:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:15:37,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-10 08:15:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:38,656 INFO L225 Difference]: With dead ends: 802137 [2019-09-10 08:15:38,656 INFO L226 Difference]: Without dead ends: 802137 [2019-09-10 08:15:38,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:15:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802137 states. [2019-09-10 08:15:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802137 to 101877. [2019-09-10 08:15:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101877 states. [2019-09-10 08:15:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101877 states to 101877 states and 143929 transitions. [2019-09-10 08:15:49,738 INFO L78 Accepts]: Start accepts. Automaton has 101877 states and 143929 transitions. Word has length 153 [2019-09-10 08:15:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:49,738 INFO L475 AbstractCegarLoop]: Abstraction has 101877 states and 143929 transitions. [2019-09-10 08:15:49,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:15:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 101877 states and 143929 transitions. [2019-09-10 08:15:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:15:49,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:49,770 INFO L399 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, 1, 1, 1, 1, 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-10 08:15:49,771 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash 896430731, now seen corresponding path program 1 times [2019-09-10 08:15:49,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:49,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:49,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:49,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:49,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:49,856 INFO L87 Difference]: Start difference. First operand 101877 states and 143929 transitions. Second operand 3 states. [2019-09-10 08:15:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:50,012 INFO L93 Difference]: Finished difference Result 52015 states and 72904 transitions. [2019-09-10 08:15:50,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:50,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:15:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:50,089 INFO L225 Difference]: With dead ends: 52015 [2019-09-10 08:15:50,089 INFO L226 Difference]: Without dead ends: 52015 [2019-09-10 08:15:50,102 INFO L628 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-10 08:15:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52015 states. [2019-09-10 08:15:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52015 to 52013. [2019-09-10 08:15:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52013 states. [2019-09-10 08:15:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52013 states to 52013 states and 72903 transitions. [2019-09-10 08:15:50,856 INFO L78 Accepts]: Start accepts. Automaton has 52013 states and 72903 transitions. Word has length 153 [2019-09-10 08:15:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:50,856 INFO L475 AbstractCegarLoop]: Abstraction has 52013 states and 72903 transitions. [2019-09-10 08:15:50,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 52013 states and 72903 transitions. [2019-09-10 08:15:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:15:50,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:50,875 INFO L399 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, 1, 1, 1, 1, 1, 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-10 08:15:50,875 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 118660324, now seen corresponding path program 1 times [2019-09-10 08:15:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:50,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:51,161 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-10 08:15:51,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:51,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:15:51,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:51,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:15:51,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:15:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:15:51,163 INFO L87 Difference]: Start difference. First operand 52013 states and 72903 transitions. Second operand 10 states. [2019-09-10 08:15:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:53,909 INFO L93 Difference]: Finished difference Result 309493 states and 432808 transitions. [2019-09-10 08:15:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:15:53,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:15:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:54,257 INFO L225 Difference]: With dead ends: 309493 [2019-09-10 08:15:54,257 INFO L226 Difference]: Without dead ends: 309493 [2019-09-10 08:15:54,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:15:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309493 states. [2019-09-10 08:15:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309493 to 52601. [2019-09-10 08:15:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52601 states. [2019-09-10 08:15:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52601 states to 52601 states and 73599 transitions. [2019-09-10 08:15:56,839 INFO L78 Accepts]: Start accepts. Automaton has 52601 states and 73599 transitions. Word has length 154 [2019-09-10 08:15:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:56,839 INFO L475 AbstractCegarLoop]: Abstraction has 52601 states and 73599 transitions. [2019-09-10 08:15:56,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:15:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 52601 states and 73599 transitions. [2019-09-10 08:15:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:15:56,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:56,854 INFO L399 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, 1, 1, 1, 1, 1, 1, 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-10 08:15:56,854 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:56,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash -902049072, now seen corresponding path program 1 times [2019-09-10 08:15:56,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:56,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:56,911 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-10 08:15:56,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:56,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:56,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:56,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:56,913 INFO L87 Difference]: Start difference. First operand 52601 states and 73599 transitions. Second operand 3 states. [2019-09-10 08:15:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:57,148 INFO L93 Difference]: Finished difference Result 51465 states and 71789 transitions. [2019-09-10 08:15:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:57,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 08:15:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:57,199 INFO L225 Difference]: With dead ends: 51465 [2019-09-10 08:15:57,199 INFO L226 Difference]: Without dead ends: 51465 [2019-09-10 08:15:57,199 INFO L628 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-10 08:15:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51465 states. [2019-09-10 08:15:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51465 to 51465. [2019-09-10 08:15:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51465 states. [2019-09-10 08:15:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51465 states to 51465 states and 71789 transitions. [2019-09-10 08:15:58,339 INFO L78 Accepts]: Start accepts. Automaton has 51465 states and 71789 transitions. Word has length 155 [2019-09-10 08:15:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:58,339 INFO L475 AbstractCegarLoop]: Abstraction has 51465 states and 71789 transitions. [2019-09-10 08:15:58,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 51465 states and 71789 transitions. [2019-09-10 08:15:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:15:58,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:58,359 INFO L399 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, 1, 1, 1, 1, 1, 1, 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-10 08:15:58,360 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:58,360 INFO L82 PathProgramCache]: Analyzing trace with hash 715005044, now seen corresponding path program 1 times [2019-09-10 08:15:58,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:58,615 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-10 08:15:58,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:58,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:15:58,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:58,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:15:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:15:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:15:58,617 INFO L87 Difference]: Start difference. First operand 51465 states and 71789 transitions. Second operand 10 states. [2019-09-10 08:16:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:02,626 INFO L93 Difference]: Finished difference Result 439463 states and 607296 transitions. [2019-09-10 08:16:02,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:16:02,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:16:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:03,214 INFO L225 Difference]: With dead ends: 439463 [2019-09-10 08:16:03,215 INFO L226 Difference]: Without dead ends: 439463 [2019-09-10 08:16:03,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:16:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439463 states. [2019-09-10 08:16:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439463 to 51251. [2019-09-10 08:16:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51251 states. [2019-09-10 08:16:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51251 states to 51251 states and 71459 transitions. [2019-09-10 08:16:06,273 INFO L78 Accepts]: Start accepts. Automaton has 51251 states and 71459 transitions. Word has length 155 [2019-09-10 08:16:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:06,274 INFO L475 AbstractCegarLoop]: Abstraction has 51251 states and 71459 transitions. [2019-09-10 08:16:06,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:16:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 51251 states and 71459 transitions. [2019-09-10 08:16:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:16:06,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:06,287 INFO L399 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, 1, 1, 1, 1, 1, 1, 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-10 08:16:06,287 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -859379835, now seen corresponding path program 1 times [2019-09-10 08:16:06,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:06,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:06,362 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-10 08:16:06,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:06,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:06,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:06,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:06,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:06,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:06,364 INFO L87 Difference]: Start difference. First operand 51251 states and 71459 transitions. Second operand 3 states. [2019-09-10 08:16:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:06,437 INFO L93 Difference]: Finished difference Result 26165 states and 36118 transitions. [2019-09-10 08:16:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:06,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 08:16:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:06,463 INFO L225 Difference]: With dead ends: 26165 [2019-09-10 08:16:06,463 INFO L226 Difference]: Without dead ends: 26165 [2019-09-10 08:16:06,464 INFO L628 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-10 08:16:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26165 states. [2019-09-10 08:16:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26165 to 26163. [2019-09-10 08:16:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26163 states. [2019-09-10 08:16:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26163 states to 26163 states and 36117 transitions. [2019-09-10 08:16:06,647 INFO L78 Accepts]: Start accepts. Automaton has 26163 states and 36117 transitions. Word has length 155 [2019-09-10 08:16:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:06,647 INFO L475 AbstractCegarLoop]: Abstraction has 26163 states and 36117 transitions. [2019-09-10 08:16:06,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 26163 states and 36117 transitions. [2019-09-10 08:16:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:16:06,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:06,654 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:06,654 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash -798133749, now seen corresponding path program 1 times [2019-09-10 08:16:06,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:06,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:06,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:06,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:06,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:06,895 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-10 08:16:06,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:06,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:16:06,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:06,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:16:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:16:06,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:16:06,897 INFO L87 Difference]: Start difference. First operand 26163 states and 36117 transitions. Second operand 10 states. [2019-09-10 08:16:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:09,469 INFO L93 Difference]: Finished difference Result 200747 states and 276768 transitions. [2019-09-10 08:16:09,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:16:09,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-10 08:16:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:09,674 INFO L225 Difference]: With dead ends: 200747 [2019-09-10 08:16:09,674 INFO L226 Difference]: Without dead ends: 200747 [2019-09-10 08:16:09,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:16:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200747 states. [2019-09-10 08:16:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200747 to 27043. [2019-09-10 08:16:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27043 states. [2019-09-10 08:16:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27043 states to 27043 states and 37219 transitions. [2019-09-10 08:16:10,843 INFO L78 Accepts]: Start accepts. Automaton has 27043 states and 37219 transitions. Word has length 156 [2019-09-10 08:16:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:10,843 INFO L475 AbstractCegarLoop]: Abstraction has 27043 states and 37219 transitions. [2019-09-10 08:16:10,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:16:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 27043 states and 37219 transitions. [2019-09-10 08:16:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:16:10,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:10,851 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:10,851 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 762384136, now seen corresponding path program 1 times [2019-09-10 08:16:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:10,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:10,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:10,927 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-10 08:16:10,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:10,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:10,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:10,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:10,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:10,929 INFO L87 Difference]: Start difference. First operand 27043 states and 37219 transitions. Second operand 3 states. [2019-09-10 08:16:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:10,982 INFO L93 Difference]: Finished difference Result 14661 states and 19894 transitions. [2019-09-10 08:16:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 08:16:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:10,999 INFO L225 Difference]: With dead ends: 14661 [2019-09-10 08:16:10,999 INFO L226 Difference]: Without dead ends: 14661 [2019-09-10 08:16:10,999 INFO L628 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-10 08:16:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14661 states. [2019-09-10 08:16:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14661 to 14659. [2019-09-10 08:16:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14659 states. [2019-09-10 08:16:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14659 states to 14659 states and 19893 transitions. [2019-09-10 08:16:11,495 INFO L78 Accepts]: Start accepts. Automaton has 14659 states and 19893 transitions. Word has length 156 [2019-09-10 08:16:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:11,495 INFO L475 AbstractCegarLoop]: Abstraction has 14659 states and 19893 transitions. [2019-09-10 08:16:11,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 14659 states and 19893 transitions. [2019-09-10 08:16:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:16:11,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:11,503 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:11,503 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:11,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1128759459, now seen corresponding path program 1 times [2019-09-10 08:16:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:11,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:11,565 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-10 08:16:11,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:11,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:11,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:11,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:11,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:11,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:11,566 INFO L87 Difference]: Start difference. First operand 14659 states and 19893 transitions. Second operand 3 states. [2019-09-10 08:16:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:11,696 INFO L93 Difference]: Finished difference Result 13635 states and 18503 transitions. [2019-09-10 08:16:11,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:11,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-10 08:16:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:11,710 INFO L225 Difference]: With dead ends: 13635 [2019-09-10 08:16:11,711 INFO L226 Difference]: Without dead ends: 13635 [2019-09-10 08:16:11,711 INFO L628 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-10 08:16:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13635 states. [2019-09-10 08:16:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13635 to 13635. [2019-09-10 08:16:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2019-09-10 08:16:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 18503 transitions. [2019-09-10 08:16:11,855 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 18503 transitions. Word has length 157 [2019-09-10 08:16:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:11,855 INFO L475 AbstractCegarLoop]: Abstraction has 13635 states and 18503 transitions. [2019-09-10 08:16:11,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 18503 transitions. [2019-09-10 08:16:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:16:11,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:11,861 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:11,862 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash 852948978, now seen corresponding path program 1 times [2019-09-10 08:16:11,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:11,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:11,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:11,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:11,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:11,979 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-10 08:16:11,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:11,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:16:11,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:11,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:16:11,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:16:11,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:16:11,985 INFO L87 Difference]: Start difference. First operand 13635 states and 18503 transitions. Second operand 4 states. [2019-09-10 08:16:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:12,034 INFO L93 Difference]: Finished difference Result 13843 states and 18607 transitions. [2019-09-10 08:16:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:16:12,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-10 08:16:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:12,067 INFO L225 Difference]: With dead ends: 13843 [2019-09-10 08:16:12,067 INFO L226 Difference]: Without dead ends: 13603 [2019-09-10 08:16:12,068 INFO L628 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-10 08:16:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13603 states. [2019-09-10 08:16:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13603 to 13595. [2019-09-10 08:16:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13595 states. [2019-09-10 08:16:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13595 states to 13595 states and 18291 transitions. [2019-09-10 08:16:12,225 INFO L78 Accepts]: Start accepts. Automaton has 13595 states and 18291 transitions. Word has length 157 [2019-09-10 08:16:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:12,227 INFO L475 AbstractCegarLoop]: Abstraction has 13595 states and 18291 transitions. [2019-09-10 08:16:12,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:16:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 13595 states and 18291 transitions. [2019-09-10 08:16:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:16:12,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:12,234 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:12,234 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash 589870381, now seen corresponding path program 1 times [2019-09-10 08:16:12,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:12,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:12,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:12,293 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-10 08:16:12,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:12,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:12,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:12,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:12,294 INFO L87 Difference]: Start difference. First operand 13595 states and 18291 transitions. Second operand 3 states. [2019-09-10 08:16:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:12,364 INFO L93 Difference]: Finished difference Result 19757 states and 25156 transitions. [2019-09-10 08:16:12,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:12,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-10 08:16:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:12,403 INFO L225 Difference]: With dead ends: 19757 [2019-09-10 08:16:12,404 INFO L226 Difference]: Without dead ends: 19749 [2019-09-10 08:16:12,404 INFO L628 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-10 08:16:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2019-09-10 08:16:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 19067. [2019-09-10 08:16:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19067 states. [2019-09-10 08:16:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19067 states to 19067 states and 24331 transitions. [2019-09-10 08:16:12,596 INFO L78 Accepts]: Start accepts. Automaton has 19067 states and 24331 transitions. Word has length 159 [2019-09-10 08:16:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:12,596 INFO L475 AbstractCegarLoop]: Abstraction has 19067 states and 24331 transitions. [2019-09-10 08:16:12,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 19067 states and 24331 transitions. [2019-09-10 08:16:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:16:12,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:12,602 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:12,602 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:12,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1152054145, now seen corresponding path program 1 times [2019-09-10 08:16:12,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:12,682 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-10 08:16:12,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:12,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:12,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:12,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:12,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:12,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:12,683 INFO L87 Difference]: Start difference. First operand 19067 states and 24331 transitions. Second operand 3 states. [2019-09-10 08:16:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:12,759 INFO L93 Difference]: Finished difference Result 21269 states and 27268 transitions. [2019-09-10 08:16:12,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:12,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 08:16:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:12,792 INFO L225 Difference]: With dead ends: 21269 [2019-09-10 08:16:12,792 INFO L226 Difference]: Without dead ends: 21269 [2019-09-10 08:16:12,792 INFO L628 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-10 08:16:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-09-10 08:16:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 19251. [2019-09-10 08:16:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19251 states. [2019-09-10 08:16:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19251 states to 19251 states and 24555 transitions. [2019-09-10 08:16:13,014 INFO L78 Accepts]: Start accepts. Automaton has 19251 states and 24555 transitions. Word has length 160 [2019-09-10 08:16:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:13,014 INFO L475 AbstractCegarLoop]: Abstraction has 19251 states and 24555 transitions. [2019-09-10 08:16:13,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19251 states and 24555 transitions. [2019-09-10 08:16:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:16:13,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:13,019 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:13,020 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash 464817316, now seen corresponding path program 1 times [2019-09-10 08:16:13,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:13,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:13,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:13,099 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-10 08:16:13,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:13,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:13,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:13,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:13,101 INFO L87 Difference]: Start difference. First operand 19251 states and 24555 transitions. Second operand 3 states. [2019-09-10 08:16:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:13,188 INFO L93 Difference]: Finished difference Result 19229 states and 24456 transitions. [2019-09-10 08:16:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:13,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:16:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:13,210 INFO L225 Difference]: With dead ends: 19229 [2019-09-10 08:16:13,210 INFO L226 Difference]: Without dead ends: 19217 [2019-09-10 08:16:13,211 INFO L628 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-10 08:16:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2019-09-10 08:16:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 15403. [2019-09-10 08:16:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15403 states. [2019-09-10 08:16:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15403 states to 15403 states and 19549 transitions. [2019-09-10 08:16:13,414 INFO L78 Accepts]: Start accepts. Automaton has 15403 states and 19549 transitions. Word has length 161 [2019-09-10 08:16:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:13,414 INFO L475 AbstractCegarLoop]: Abstraction has 15403 states and 19549 transitions. [2019-09-10 08:16:13,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 15403 states and 19549 transitions. [2019-09-10 08:16:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:16:13,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:13,420 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:13,420 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:13,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1676333787, now seen corresponding path program 1 times [2019-09-10 08:16:13,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:13,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:13,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:13,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:13,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:13,492 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-10 08:16:13,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:13,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:16:13,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:13,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:16:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:16:13,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:16:13,493 INFO L87 Difference]: Start difference. First operand 15403 states and 19549 transitions. Second operand 4 states. [2019-09-10 08:16:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:13,806 INFO L93 Difference]: Finished difference Result 30085 states and 38221 transitions. [2019-09-10 08:16:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:13,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 08:16:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:13,830 INFO L225 Difference]: With dead ends: 30085 [2019-09-10 08:16:13,830 INFO L226 Difference]: Without dead ends: 30085 [2019-09-10 08:16:13,830 INFO L628 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-10 08:16:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30085 states. [2019-09-10 08:16:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30085 to 14919. [2019-09-10 08:16:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14919 states. [2019-09-10 08:16:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14919 states to 14919 states and 18968 transitions. [2019-09-10 08:16:14,205 INFO L78 Accepts]: Start accepts. Automaton has 14919 states and 18968 transitions. Word has length 161 [2019-09-10 08:16:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:14,205 INFO L475 AbstractCegarLoop]: Abstraction has 14919 states and 18968 transitions. [2019-09-10 08:16:14,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:16:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14919 states and 18968 transitions. [2019-09-10 08:16:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:16:14,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:14,209 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:14,209 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1308062560, now seen corresponding path program 1 times [2019-09-10 08:16:14,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:14,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:14,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:14,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:14,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:14,281 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-10 08:16:14,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:14,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:14,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:14,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:14,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:14,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:14,283 INFO L87 Difference]: Start difference. First operand 14919 states and 18968 transitions. Second operand 3 states. [2019-09-10 08:16:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:14,331 INFO L93 Difference]: Finished difference Result 15449 states and 19409 transitions. [2019-09-10 08:16:14,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:14,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:16:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:14,347 INFO L225 Difference]: With dead ends: 15449 [2019-09-10 08:16:14,347 INFO L226 Difference]: Without dead ends: 15449 [2019-09-10 08:16:14,347 INFO L628 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-10 08:16:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15449 states. [2019-09-10 08:16:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15449 to 14927. [2019-09-10 08:16:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14927 states. [2019-09-10 08:16:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14927 states to 14927 states and 18784 transitions. [2019-09-10 08:16:14,468 INFO L78 Accepts]: Start accepts. Automaton has 14927 states and 18784 transitions. Word has length 161 [2019-09-10 08:16:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:14,468 INFO L475 AbstractCegarLoop]: Abstraction has 14927 states and 18784 transitions. [2019-09-10 08:16:14,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14927 states and 18784 transitions. [2019-09-10 08:16:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:16:14,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:14,470 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:14,471 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash -698062044, now seen corresponding path program 1 times [2019-09-10 08:16:14,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:14,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:14,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:14,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:14,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:14,563 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-10 08:16:14,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:14,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:16:14,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:14,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:16:14,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:16:14,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:16:14,565 INFO L87 Difference]: Start difference. First operand 14927 states and 18784 transitions. Second operand 6 states. [2019-09-10 08:16:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:14,667 INFO L93 Difference]: Finished difference Result 23458 states and 29880 transitions. [2019-09-10 08:16:14,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:16:14,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 08:16:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:14,686 INFO L225 Difference]: With dead ends: 23458 [2019-09-10 08:16:14,686 INFO L226 Difference]: Without dead ends: 23458 [2019-09-10 08:16:14,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:16:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23458 states. [2019-09-10 08:16:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23458 to 15247. [2019-09-10 08:16:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15247 states. [2019-09-10 08:16:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15247 states to 15247 states and 19056 transitions. [2019-09-10 08:16:14,821 INFO L78 Accepts]: Start accepts. Automaton has 15247 states and 19056 transitions. Word has length 161 [2019-09-10 08:16:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:14,822 INFO L475 AbstractCegarLoop]: Abstraction has 15247 states and 19056 transitions. [2019-09-10 08:16:14,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:16:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 15247 states and 19056 transitions. [2019-09-10 08:16:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 08:16:14,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:14,825 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:14,825 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash -904366186, now seen corresponding path program 1 times [2019-09-10 08:16:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:14,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:14,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:14,899 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-10 08:16:14,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:14,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:14,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:14,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:14,901 INFO L87 Difference]: Start difference. First operand 15247 states and 19056 transitions. Second operand 3 states. [2019-09-10 08:16:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:14,981 INFO L93 Difference]: Finished difference Result 22193 states and 27681 transitions. [2019-09-10 08:16:14,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:14,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-10 08:16:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:15,000 INFO L225 Difference]: With dead ends: 22193 [2019-09-10 08:16:15,000 INFO L226 Difference]: Without dead ends: 22193 [2019-09-10 08:16:15,000 INFO L628 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-10 08:16:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22193 states. [2019-09-10 08:16:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22193 to 22191. [2019-09-10 08:16:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22191 states. [2019-09-10 08:16:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22191 states to 22191 states and 27680 transitions. [2019-09-10 08:16:15,173 INFO L78 Accepts]: Start accepts. Automaton has 22191 states and 27680 transitions. Word has length 162 [2019-09-10 08:16:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:15,174 INFO L475 AbstractCegarLoop]: Abstraction has 22191 states and 27680 transitions. [2019-09-10 08:16:15,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 22191 states and 27680 transitions. [2019-09-10 08:16:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:16:15,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:15,181 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:15,181 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:15,181 INFO L82 PathProgramCache]: Analyzing trace with hash -283014086, now seen corresponding path program 1 times [2019-09-10 08:16:15,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:16:15,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:15,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:16:15,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:15,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:16:15,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:16:15,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:16:15,322 INFO L87 Difference]: Start difference. First operand 22191 states and 27680 transitions. Second operand 5 states. [2019-09-10 08:16:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:15,542 INFO L93 Difference]: Finished difference Result 32957 states and 41353 transitions. [2019-09-10 08:16:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:15,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-10 08:16:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:15,577 INFO L225 Difference]: With dead ends: 32957 [2019-09-10 08:16:15,577 INFO L226 Difference]: Without dead ends: 32953 [2019-09-10 08:16:15,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:16:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32953 states. [2019-09-10 08:16:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32953 to 32947. [2019-09-10 08:16:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32947 states. [2019-09-10 08:16:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32947 states to 32947 states and 41346 transitions. [2019-09-10 08:16:15,843 INFO L78 Accepts]: Start accepts. Automaton has 32947 states and 41346 transitions. Word has length 193 [2019-09-10 08:16:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:15,844 INFO L475 AbstractCegarLoop]: Abstraction has 32947 states and 41346 transitions. [2019-09-10 08:16:15,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:16:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 32947 states and 41346 transitions. [2019-09-10 08:16:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:16:15,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:15,851 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:16:15,851 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:15,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1282710734, now seen corresponding path program 1 times [2019-09-10 08:16:15,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:15,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:15,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:16,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:16:16,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:16:16,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:16:16,476 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [309], [315], [319], [321], [324], [327], [330], [335], [337], [340], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [408], [414], [417], [418], [420], [422], [425], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [545], [547], [550], [553], [555], [563], [566], [572], [575], [578], [580], [589], [592], [705], [708], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:16:16,523 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:16:16,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:16:16,674 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:16:16,883 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:16:16,885 INFO L272 AbstractInterpreter]: Visited 119 different actions 119 times. Never merged. Never widened. Performed 624 root evaluator evaluations with a maximum evaluation depth of 6. Performed 624 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:16:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:16,890 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:16:17,628 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 75.55% of their original sizes. [2019-09-10 08:16:17,628 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:16:25,704 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 08:16:25,704 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:16:25,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:16:25,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [12] total 74 [2019-09-10 08:16:25,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:25,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 08:16:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 08:16:25,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3702, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 08:16:25,708 INFO L87 Difference]: Start difference. First operand 32947 states and 41346 transitions. Second operand 64 states. [2019-09-10 08:17:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:12,476 INFO L93 Difference]: Finished difference Result 32512 states and 40831 transitions. [2019-09-10 08:17:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 08:17:12,476 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2019-09-10 08:17:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:12,509 INFO L225 Difference]: With dead ends: 32512 [2019-09-10 08:17:12,509 INFO L226 Difference]: Without dead ends: 32504 [2019-09-10 08:17:12,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2922 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=673, Invalid=9833, Unknown=0, NotChecked=0, Total=10506 [2019-09-10 08:17:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32504 states. [2019-09-10 08:17:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32504 to 32463. [2019-09-10 08:17:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32463 states. [2019-09-10 08:17:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32463 states to 32463 states and 40769 transitions. [2019-09-10 08:17:12,745 INFO L78 Accepts]: Start accepts. Automaton has 32463 states and 40769 transitions. Word has length 193 [2019-09-10 08:17:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:12,745 INFO L475 AbstractCegarLoop]: Abstraction has 32463 states and 40769 transitions. [2019-09-10 08:17:12,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 08:17:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 32463 states and 40769 transitions. [2019-09-10 08:17:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:17:12,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:12,753 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:17:12,753 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -574308905, now seen corresponding path program 1 times [2019-09-10 08:17:12,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:12,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:12,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:12,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:12,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:12,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:17:12,923 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [247], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [348], [350], [353], [356], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [513], [516], [522], [525], [528], [530], [545], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [630], [633], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:17:12,941 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:12,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:12,988 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:13,093 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:17:13,093 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:17:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:13,094 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:17:13,436 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.86% of their original sizes. [2019-09-10 08:17:13,437 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:17:22,356 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 08:17:22,356 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:17:22,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:17:22,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-09-10 08:17:22,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:22,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:17:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:17:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:17:22,358 INFO L87 Difference]: Start difference. First operand 32463 states and 40769 transitions. Second operand 63 states. [2019-09-10 08:18:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:09,778 INFO L93 Difference]: Finished difference Result 32528 states and 40848 transitions. [2019-09-10 08:18:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 08:18:09,778 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2019-09-10 08:18:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:09,804 INFO L225 Difference]: With dead ends: 32528 [2019-09-10 08:18:09,804 INFO L226 Difference]: Without dead ends: 32518 [2019-09-10 08:18:09,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=655, Invalid=9445, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 08:18:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32518 states. [2019-09-10 08:18:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32518 to 32485. [2019-09-10 08:18:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32485 states. [2019-09-10 08:18:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32485 states to 32485 states and 40795 transitions. [2019-09-10 08:18:10,050 INFO L78 Accepts]: Start accepts. Automaton has 32485 states and 40795 transitions. Word has length 193 [2019-09-10 08:18:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:10,050 INFO L475 AbstractCegarLoop]: Abstraction has 32485 states and 40795 transitions. [2019-09-10 08:18:10,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:18:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32485 states and 40795 transitions. [2019-09-10 08:18:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:18:10,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:10,059 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:18:10,059 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:10,059 INFO L82 PathProgramCache]: Analyzing trace with hash 181359151, now seen corresponding path program 1 times [2019-09-10 08:18:10,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:10,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:10,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:10,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:10,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:18:10,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:18:10,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:18:10,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:18:10,273 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [247], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [408], [412], [414], [417], [418], [420], [422], [427], [429], [432], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [545], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:18:10,277 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:18:10,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:18:10,309 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:18:12,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:18:12,263 INFO L272 AbstractInterpreter]: Visited 183 different actions 1159 times. Merged at 61 different actions 845 times. Widened at 28 different actions 175 times. Performed 4101 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 136 fixpoints after 27 different actions. Largest state had 188 variables. [2019-09-10 08:18:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:12,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:18:12,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:18:12,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:18:12,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:12,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:18:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:12,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 08:18:12,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:18:12,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:13,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:18:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:14,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:20,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:20,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:18:20,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 25 [2019-09-10 08:18:20,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:18:20,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:18:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:18:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:18:20,842 INFO L87 Difference]: Start difference. First operand 32485 states and 40795 transitions. Second operand 15 states. [2019-09-10 08:18:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:31,651 INFO L93 Difference]: Finished difference Result 149455 states and 187298 transitions. [2019-09-10 08:18:31,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:18:31,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 193 [2019-09-10 08:18:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:32,038 INFO L225 Difference]: With dead ends: 149455 [2019-09-10 08:18:32,038 INFO L226 Difference]: Without dead ends: 149423 [2019-09-10 08:18:32,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 292 SyntacticMatches, 76 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=735, Invalid=2345, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:18:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149423 states. [2019-09-10 08:18:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149423 to 95515. [2019-09-10 08:18:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95515 states. [2019-09-10 08:18:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95515 states to 95515 states and 118199 transitions. [2019-09-10 08:18:34,472 INFO L78 Accepts]: Start accepts. Automaton has 95515 states and 118199 transitions. Word has length 193 [2019-09-10 08:18:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:34,472 INFO L475 AbstractCegarLoop]: Abstraction has 95515 states and 118199 transitions. [2019-09-10 08:18:34,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:18:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 95515 states and 118199 transitions. [2019-09-10 08:18:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:18:34,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:34,489 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:18:34,489 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1407463604, now seen corresponding path program 1 times [2019-09-10 08:18:34,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:34,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:34,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:34,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:18:34,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:18:34,900 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:18:34,901 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [247], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [286], [288], [290], [293], [296], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [343], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [538], [541], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [605], [608], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:18:34,907 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:18:34,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:18:34,938 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:18:35,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:18:35,005 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:18:35,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:35,005 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:18:35,271 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.88% of their original sizes. [2019-09-10 08:18:35,271 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:18:43,816 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 08:18:43,817 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:18:43,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:18:43,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [12] total 73 [2019-09-10 08:18:43,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:43,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:18:43,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:18:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3578, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:18:43,820 INFO L87 Difference]: Start difference. First operand 95515 states and 118199 transitions. Second operand 63 states. [2019-09-10 08:19:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:30,582 INFO L93 Difference]: Finished difference Result 95567 states and 118260 transitions. [2019-09-10 08:19:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 08:19:30,583 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2019-09-10 08:19:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:30,666 INFO L225 Difference]: With dead ends: 95567 [2019-09-10 08:19:30,666 INFO L226 Difference]: Without dead ends: 95562 [2019-09-10 08:19:30,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2781 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=656, Invalid=9444, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 08:19:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95562 states. [2019-09-10 08:19:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95562 to 95521. [2019-09-10 08:19:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95521 states. [2019-09-10 08:19:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95521 states to 95521 states and 118206 transitions. [2019-09-10 08:19:31,480 INFO L78 Accepts]: Start accepts. Automaton has 95521 states and 118206 transitions. Word has length 193 [2019-09-10 08:19:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:31,480 INFO L475 AbstractCegarLoop]: Abstraction has 95521 states and 118206 transitions. [2019-09-10 08:19:31,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:19:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 95521 states and 118206 transitions. [2019-09-10 08:19:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:19:31,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:31,491 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:31,491 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -816008108, now seen corresponding path program 1 times [2019-09-10 08:19:31,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:31,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:31,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:31,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:19:31,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:19:31,673 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:19:31,674 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [247], [249], [251], [254], [257], [260], [262], [264], [267], [270], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [343], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [538], [541], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [655], [658], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:19:31,677 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:19:31,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:19:31,701 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:19:31,766 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:19:31,767 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:19:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:31,767 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:19:32,067 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.75% of their original sizes. [2019-09-10 08:19:32,067 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:19:41,002 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 08:19:41,003 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:19:41,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:19:41,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-09-10 08:19:41,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:41,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:19:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:19:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:19:41,005 INFO L87 Difference]: Start difference. First operand 95521 states and 118206 transitions. Second operand 63 states. [2019-09-10 08:20:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:28,351 INFO L93 Difference]: Finished difference Result 95569 states and 118264 transitions. [2019-09-10 08:20:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 08:20:28,351 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2019-09-10 08:20:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:28,438 INFO L225 Difference]: With dead ends: 95569 [2019-09-10 08:20:28,438 INFO L226 Difference]: Without dead ends: 95559 [2019-09-10 08:20:28,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=655, Invalid=9445, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 08:20:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95559 states. [2019-09-10 08:20:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95559 to 95533. [2019-09-10 08:20:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95533 states. [2019-09-10 08:20:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95533 states to 95533 states and 118220 transitions. [2019-09-10 08:20:29,548 INFO L78 Accepts]: Start accepts. Automaton has 95533 states and 118220 transitions. Word has length 193 [2019-09-10 08:20:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:29,548 INFO L475 AbstractCegarLoop]: Abstraction has 95533 states and 118220 transitions. [2019-09-10 08:20:29,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:20:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 95533 states and 118220 transitions. [2019-09-10 08:20:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:20:29,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:29,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:20:29,558 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:29,558 INFO L82 PathProgramCache]: Analyzing trace with hash -662687247, now seen corresponding path program 1 times [2019-09-10 08:20:29,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:29,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:29,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:29,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:29,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:29,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:29,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:29,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:20:29,747 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [247], [249], [251], [254], [257], [262], [264], [267], [270], [273], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [343], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [538], [541], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [680], [683], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:20:29,750 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:29,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:29,772 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:29,834 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:20:29,835 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:20:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:29,835 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:20:30,102 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.69% of their original sizes. [2019-09-10 08:20:30,102 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:20:38,606 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 08:20:38,606 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:20:38,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:20:38,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-09-10 08:20:38,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:38,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:20:38,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:20:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:20:38,609 INFO L87 Difference]: Start difference. First operand 95533 states and 118220 transitions. Second operand 63 states. [2019-09-10 08:21:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:21,050 INFO L93 Difference]: Finished difference Result 95586 states and 118284 transitions. [2019-09-10 08:21:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 08:21:21,051 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2019-09-10 08:21:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:21,134 INFO L225 Difference]: With dead ends: 95586 [2019-09-10 08:21:21,134 INFO L226 Difference]: Without dead ends: 95576 [2019-09-10 08:21:21,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=655, Invalid=9445, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 08:21:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95576 states. [2019-09-10 08:21:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95576 to 95544. [2019-09-10 08:21:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95544 states. [2019-09-10 08:21:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95544 states to 95544 states and 118234 transitions. [2019-09-10 08:21:21,889 INFO L78 Accepts]: Start accepts. Automaton has 95544 states and 118234 transitions. Word has length 193 [2019-09-10 08:21:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:21,889 INFO L475 AbstractCegarLoop]: Abstraction has 95544 states and 118234 transitions. [2019-09-10 08:21:21,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:21:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 95544 states and 118234 transitions. [2019-09-10 08:21:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:21:21,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:21,898 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:21:21,898 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1845950825, now seen corresponding path program 1 times [2019-09-10 08:21:21,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:21,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:21,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:21,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:22,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:21:22,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:21:22,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:21:22,071 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [236], [238], [241], [244], [247], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [348], [350], [353], [356], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [513], [516], [522], [525], [528], [530], [545], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [730], [733], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:21:22,075 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:21:22,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:21:22,103 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:21:22,190 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:21:22,191 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:21:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:22,191 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:21:22,449 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.61% of their original sizes. [2019-09-10 08:21:22,450 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:21:30,466 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 08:21:30,467 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:21:30,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:21:30,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [6] total 68 [2019-09-10 08:21:30,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:30,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 08:21:30,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 08:21:30,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=3700, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 08:21:30,470 INFO L87 Difference]: Start difference. First operand 95544 states and 118234 transitions. Second operand 64 states. [2019-09-10 08:22:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:27,799 INFO L93 Difference]: Finished difference Result 95602 states and 118304 transitions. [2019-09-10 08:22:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 08:22:27,799 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2019-09-10 08:22:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:27,896 INFO L225 Difference]: With dead ends: 95602 [2019-09-10 08:22:27,896 INFO L226 Difference]: Without dead ends: 95592 [2019-09-10 08:22:27,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=665, Invalid=9637, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 08:22:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95592 states. [2019-09-10 08:22:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95592 to 95565. [2019-09-10 08:22:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95565 states. [2019-09-10 08:22:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95565 states to 95565 states and 118258 transitions. [2019-09-10 08:22:28,739 INFO L78 Accepts]: Start accepts. Automaton has 95565 states and 118258 transitions. Word has length 193 [2019-09-10 08:22:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:28,740 INFO L475 AbstractCegarLoop]: Abstraction has 95565 states and 118258 transitions. [2019-09-10 08:22:28,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 08:22:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 95565 states and 118258 transitions. [2019-09-10 08:22:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:22:28,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:28,750 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:22:28,751 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash 203977, now seen corresponding path program 1 times [2019-09-10 08:22:28,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:22:28,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:28,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:22:28,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:28,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:22:28,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:22:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:22:28,968 INFO L87 Difference]: Start difference. First operand 95565 states and 118258 transitions. Second operand 8 states. [2019-09-10 08:22:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:29,599 INFO L93 Difference]: Finished difference Result 242934 states and 300780 transitions. [2019-09-10 08:22:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:22:29,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 194 [2019-09-10 08:22:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:29,874 INFO L225 Difference]: With dead ends: 242934 [2019-09-10 08:22:29,874 INFO L226 Difference]: Without dead ends: 242790 [2019-09-10 08:22:29,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:22:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242790 states. [2019-09-10 08:22:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242790 to 242009. [2019-09-10 08:22:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242009 states. [2019-09-10 08:22:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242009 states to 242009 states and 299708 transitions. [2019-09-10 08:22:32,481 INFO L78 Accepts]: Start accepts. Automaton has 242009 states and 299708 transitions. Word has length 194 [2019-09-10 08:22:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:32,482 INFO L475 AbstractCegarLoop]: Abstraction has 242009 states and 299708 transitions. [2019-09-10 08:22:32,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:22:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 242009 states and 299708 transitions. [2019-09-10 08:22:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:22:32,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:32,499 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:22:32,499 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:32,499 INFO L82 PathProgramCache]: Analyzing trace with hash -624636948, now seen corresponding path program 1 times [2019-09-10 08:22:32,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:32,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:32,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:32,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:22:32,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:32,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:22:32,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:32,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:22:32,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:22:32,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:22:32,689 INFO L87 Difference]: Start difference. First operand 242009 states and 299708 transitions. Second operand 8 states. [2019-09-10 08:22:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:33,578 INFO L93 Difference]: Finished difference Result 340685 states and 421905 transitions. [2019-09-10 08:22:33,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:22:33,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 194 [2019-09-10 08:22:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:38,756 INFO L225 Difference]: With dead ends: 340685 [2019-09-10 08:22:38,756 INFO L226 Difference]: Without dead ends: 340625 [2019-09-10 08:22:38,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:22:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340625 states. [2019-09-10 08:22:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340625 to 333083. [2019-09-10 08:22:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333083 states. [2019-09-10 08:22:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333083 states to 333083 states and 412380 transitions. [2019-09-10 08:22:42,235 INFO L78 Accepts]: Start accepts. Automaton has 333083 states and 412380 transitions. Word has length 194 [2019-09-10 08:22:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:42,235 INFO L475 AbstractCegarLoop]: Abstraction has 333083 states and 412380 transitions. [2019-09-10 08:22:42,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:22:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 333083 states and 412380 transitions. [2019-09-10 08:22:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:22:42,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:42,253 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:22:42,253 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1446858636, now seen corresponding path program 1 times [2019-09-10 08:22:42,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:42,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:42,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:42,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:42,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:42,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:22:42,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:22:42,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 08:22:42,389 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [249], [251], [254], [257], [260], [262], [264], [267], [270], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [343], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [538], [541], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [655], [658], [705], [708], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:22:42,392 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:22:42,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:22:42,412 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:22:42,458 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:22:42,458 INFO L272 AbstractInterpreter]: Visited 119 different actions 119 times. Never merged. Never widened. Performed 624 root evaluator evaluations with a maximum evaluation depth of 6. Performed 624 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:22:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:42,459 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:22:42,667 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 75.43% of their original sizes. [2019-09-10 08:22:42,667 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:22:51,911 INFO L420 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2019-09-10 08:22:51,911 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:22:51,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:22:51,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [6] total 68 [2019-09-10 08:22:51,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:51,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 08:22:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 08:22:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3702, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 08:22:51,914 INFO L87 Difference]: Start difference. First operand 333083 states and 412380 transitions. Second operand 64 states. [2019-09-10 08:23:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:41,340 INFO L93 Difference]: Finished difference Result 333118 states and 412419 transitions. [2019-09-10 08:23:41,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 08:23:41,340 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 194 [2019-09-10 08:23:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:41,723 INFO L225 Difference]: With dead ends: 333118 [2019-09-10 08:23:41,723 INFO L226 Difference]: Without dead ends: 333112 [2019-09-10 08:23:41,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2922 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=673, Invalid=9833, Unknown=0, NotChecked=0, Total=10506 [2019-09-10 08:23:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333112 states. [2019-09-10 08:23:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333112 to 333100. [2019-09-10 08:23:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333100 states. [2019-09-10 08:23:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333100 states to 333100 states and 412398 transitions. [2019-09-10 08:23:51,492 INFO L78 Accepts]: Start accepts. Automaton has 333100 states and 412398 transitions. Word has length 194 [2019-09-10 08:23:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:51,492 INFO L475 AbstractCegarLoop]: Abstraction has 333100 states and 412398 transitions. [2019-09-10 08:23:51,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 08:23:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 333100 states and 412398 transitions. [2019-09-10 08:23:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:23:51,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:51,510 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:23:51,510 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1600179497, now seen corresponding path program 1 times [2019-09-10 08:23:51,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:51,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:51,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:51,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:51,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:23:51,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:51,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:23:51,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:51,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:23:51,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:23:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:23:51,704 INFO L87 Difference]: Start difference. First operand 333100 states and 412398 transitions. Second operand 8 states. [2019-09-10 08:23:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:54,074 INFO L93 Difference]: Finished difference Result 574893 states and 712435 transitions. [2019-09-10 08:23:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:23:54,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 194 [2019-09-10 08:23:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:54,775 INFO L225 Difference]: With dead ends: 574893 [2019-09-10 08:23:54,775 INFO L226 Difference]: Without dead ends: 574845 [2019-09-10 08:23:54,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574845 states. [2019-09-10 08:24:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574845 to 574155. [2019-09-10 08:24:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574155 states. [2019-09-10 08:24:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574155 states to 574155 states and 711584 transitions. [2019-09-10 08:24:17,228 INFO L78 Accepts]: Start accepts. Automaton has 574155 states and 711584 transitions. Word has length 194 [2019-09-10 08:24:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:17,228 INFO L475 AbstractCegarLoop]: Abstraction has 574155 states and 711584 transitions. [2019-09-10 08:24:17,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:24:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 574155 states and 711584 transitions. [2019-09-10 08:24:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:24:17,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:17,254 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:24:17,254 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:17,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1897700743, now seen corresponding path program 1 times [2019-09-10 08:24:17,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:17,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:17,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:24:17,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:24:17,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 08:24:17,392 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [343], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [538], [541], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [630], [633], [705], [710], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:24:17,394 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:24:17,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:24:17,411 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:24:17,451 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:24:17,451 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:24:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:17,452 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:24:17,611 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 75.43% of their original sizes. [2019-09-10 08:24:17,611 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:24:27,178 INFO L420 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2019-09-10 08:24:27,179 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:24:27,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:24:27,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [6] total 68 [2019-09-10 08:24:27,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:27,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 08:24:27,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 08:24:27,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3699, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 08:24:27,181 INFO L87 Difference]: Start difference. First operand 574155 states and 711584 transitions. Second operand 64 states. [2019-09-10 08:25:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:12,277 INFO L93 Difference]: Finished difference Result 574201 states and 711638 transitions. [2019-09-10 08:25:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 08:25:12,277 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 194 [2019-09-10 08:25:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:13,024 INFO L225 Difference]: With dead ends: 574201 [2019-09-10 08:25:13,025 INFO L226 Difference]: Without dead ends: 574191 [2019-09-10 08:25:13,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=694, Invalid=10226, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 08:25:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574191 states. [2019-09-10 08:25:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574191 to 574165. [2019-09-10 08:25:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574165 states. [2019-09-10 08:25:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574165 states to 574165 states and 711596 transitions. [2019-09-10 08:25:26,559 INFO L78 Accepts]: Start accepts. Automaton has 574165 states and 711596 transitions. Word has length 194 [2019-09-10 08:25:26,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:26,560 INFO L475 AbstractCegarLoop]: Abstraction has 574165 states and 711596 transitions. [2019-09-10 08:25:26,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 08:25:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 574165 states and 711596 transitions. [2019-09-10 08:25:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:25:26,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:26,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:25:26,586 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1272859818, now seen corresponding path program 1 times [2019-09-10 08:25:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:26,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:26,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:26,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:26,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:26,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:25:26,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 08:25:26,785 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [286], [288], [290], [293], [296], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [343], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [538], [541], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [605], [608], [705], [710], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:25:26,787 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:25:26,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:25:26,818 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:25:26,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:25:26,931 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:25:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:26,931 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:25:27,168 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 75.49% of their original sizes. [2019-09-10 08:25:27,168 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:25:42,040 INFO L420 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2019-09-10 08:25:42,041 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:25:42,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:25:42,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [6] total 68 [2019-09-10 08:25:42,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:42,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 08:25:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 08:25:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3698, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 08:25:42,043 INFO L87 Difference]: Start difference. First operand 574165 states and 711596 transitions. Second operand 64 states. [2019-09-10 08:26:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:31,982 INFO L93 Difference]: Finished difference Result 574210 states and 711647 transitions. [2019-09-10 08:26:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 08:26:31,982 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 194 [2019-09-10 08:26:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:32,584 INFO L225 Difference]: With dead ends: 574210 [2019-09-10 08:26:32,584 INFO L226 Difference]: Without dead ends: 574205 [2019-09-10 08:26:32,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=695, Invalid=10225, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 08:26:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574205 states. [2019-09-10 08:26:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574205 to 574160. [2019-09-10 08:26:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574160 states. [2019-09-10 08:26:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574160 states to 574160 states and 711590 transitions. [2019-09-10 08:26:41,314 INFO L78 Accepts]: Start accepts. Automaton has 574160 states and 711590 transitions. Word has length 194 [2019-09-10 08:26:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:41,314 INFO L475 AbstractCegarLoop]: Abstraction has 574160 states and 711590 transitions. [2019-09-10 08:26:41,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 08:26:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 574160 states and 711590 transitions. [2019-09-10 08:26:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:26:41,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:41,342 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:26:41,342 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:41,342 INFO L82 PathProgramCache]: Analyzing trace with hash -950611894, now seen corresponding path program 1 times [2019-09-10 08:26:41,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:41,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:41,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:41,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:41,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:26:41,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 08:26:41,505 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [249], [251], [254], [257], [260], [262], [264], [267], [270], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [321], [324], [327], [335], [337], [340], [343], [348], [350], [353], [361], [363], [366], [374], [376], [379], [387], [389], [392], [400], [402], [405], [412], [414], [417], [418], [420], [429], [432], [436], [445], [447], [450], [453], [455], [470], [472], [475], [478], [480], [495], [497], [500], [503], [505], [520], [522], [525], [528], [530], [538], [541], [547], [550], [553], [555], [570], [572], [575], [578], [580], [596], [599], [655], [658], [705], [710], [763], [766], [781], [784], [787], [789], [806], [809], [812], [814], [831], [834], [837], [839], [856], [859], [862], [864], [881], [884], [887], [889], [906], [909], [912], [914], [1005], [1006], [1010], [1011], [1012] [2019-09-10 08:26:41,508 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:26:41,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:26:41,529 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:26:41,583 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:26:41,584 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 times. Never merged. Never widened. Performed 626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 188 variables. [2019-09-10 08:26:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:41,584 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:26:43,477 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 75.37% of their original sizes. [2019-09-10 08:26:43,477 INFO L418 sIntCurrentIteration]: Unifying AI predicates