java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:59:54,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:59:54,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:59:54,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:59:54,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:59:54,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:59:54,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:59:54,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:59:54,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:59:54,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:59:54,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:59:54,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:59:54,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:59:54,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:59:54,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:59:54,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:59:54,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:59:54,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:59:54,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:59:54,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:59:54,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:59:54,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:59:54,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:59:54,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:59:54,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:59:54,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:59:54,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:59:54,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:59:54,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:59:54,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:59:54,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:59:54,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:59:54,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:59:54,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:59:54,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:59:54,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:59:54,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:59:54,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:59:54,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:59:54,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:59:54,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:59:54,785 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:59:54,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:59:54,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:59:54,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:59:54,809 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:59:54,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:59:54,810 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:59:54,810 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:59:54,811 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:59:54,811 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:59:54,811 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:59:54,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:59:54,813 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:59:54,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:59:54,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:59:54,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:59:54,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:59:54,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:59:54,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:59:54,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:59:54,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:59:54,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:59:54,815 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:59:54,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:59:54,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:59:54,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:59:54,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:59:54,817 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:59:54,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:59:54,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:59:54,817 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:59:54,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:59:54,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:59:54,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:59:54,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:59:54,891 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:59:54,891 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:59:54,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca42da8/06e480da75044e699fa71ff98ff282a2/FLAG4b1a8b4a9 [2019-09-10 08:59:55,563 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:59:55,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:59:55,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca42da8/06e480da75044e699fa71ff98ff282a2/FLAG4b1a8b4a9 [2019-09-10 08:59:55,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca42da8/06e480da75044e699fa71ff98ff282a2 [2019-09-10 08:59:55,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:59:55,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:59:55,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:59:55,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:59:55,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:59:55,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:59:55" (1/1) ... [2019-09-10 08:59:55,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c93ca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:55, skipping insertion in model container [2019-09-10 08:59:55,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:59:55" (1/1) ... [2019-09-10 08:59:55,847 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:59:55,918 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:59:56,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:59:56,451 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:59:56,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:59:56,629 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:59:56,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56 WrapperNode [2019-09-10 08:59:56,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:59:56,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:59:56,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:59:56,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:59:56,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (1/1) ... [2019-09-10 08:59:56,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (1/1) ... [2019-09-10 08:59:56,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (1/1) ... [2019-09-10 08:59:56,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (1/1) ... [2019-09-10 08:59:56,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (1/1) ... [2019-09-10 08:59:56,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (1/1) ... [2019-09-10 08:59:56,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (1/1) ... [2019-09-10 08:59:56,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:59:56,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:59:56,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:59:56,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:59:56,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (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:59:56,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:59:56,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:59:56,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:59:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:59:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:59:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:59:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:59:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:59:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:59:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:59:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:59:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:59:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:59:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:59:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:59:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:59:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:59:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:59:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:59:58,265 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:59:58,265 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:59:58,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:59:58 BoogieIcfgContainer [2019-09-10 08:59:58,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:59:58,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:59:58,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:59:58,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:59:58,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:59:55" (1/3) ... [2019-09-10 08:59:58,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e891840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:59:58, skipping insertion in model container [2019-09-10 08:59:58,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:59:56" (2/3) ... [2019-09-10 08:59:58,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e891840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:59:58, skipping insertion in model container [2019-09-10 08:59:58,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:59:58" (3/3) ... [2019-09-10 08:59:58,281 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:59:58,292 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:59:58,317 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:59:58,336 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:59:58,369 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:59:58,369 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:59:58,369 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:59:58,369 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:59:58,369 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:59:58,370 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:59:58,370 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:59:58,370 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:59:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-10 08:59:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:59:58,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:59:58,434 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] [2019-09-10 08:59:58,436 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:59:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:59:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash -35123060, now seen corresponding path program 1 times [2019-09-10 08:59:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:59:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:58,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:59:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:58,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:59,162 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:59:59,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:59,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:59:59,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:59,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:59:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:59:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:59,191 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 3 states. [2019-09-10 08:59:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:59,345 INFO L93 Difference]: Finished difference Result 485 states and 839 transitions. [2019-09-10 08:59:59,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:59,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:59:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:59,380 INFO L225 Difference]: With dead ends: 485 [2019-09-10 08:59:59,380 INFO L226 Difference]: Without dead ends: 477 [2019-09-10 08:59:59,383 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:59:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-10 08:59:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2019-09-10 08:59:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-10 08:59:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 783 transitions. [2019-09-10 08:59:59,498 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 783 transitions. Word has length 122 [2019-09-10 08:59:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:59:59,499 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 783 transitions. [2019-09-10 08:59:59,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:59:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 783 transitions. [2019-09-10 08:59:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:59:59,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:59:59,504 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] [2019-09-10 08:59:59,505 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:59:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:59:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash 993718675, now seen corresponding path program 1 times [2019-09-10 08:59:59,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:59:59,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:59,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:59:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:59,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:59,741 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:59:59,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:59,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:59:59,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:59,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:59:59,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:59:59,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:59,745 INFO L87 Difference]: Start difference. First operand 475 states and 783 transitions. Second operand 3 states. [2019-09-10 08:59:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:59,777 INFO L93 Difference]: Finished difference Result 733 states and 1211 transitions. [2019-09-10 08:59:59,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:59,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:59:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:59,782 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:59:59,782 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:59:59,783 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:59:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:59:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2019-09-10 08:59:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-10 08:59:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1210 transitions. [2019-09-10 08:59:59,801 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1210 transitions. Word has length 125 [2019-09-10 08:59:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:59:59,802 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1210 transitions. [2019-09-10 08:59:59,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:59:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1210 transitions. [2019-09-10 08:59:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:59:59,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:59:59,805 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] [2019-09-10 08:59:59,805 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:59:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:59:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1625513079, now seen corresponding path program 1 times [2019-09-10 08:59:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:59:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:59:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:59,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:59,932 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:59:59,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:59,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:59:59,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:59,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:59:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:59:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:59,934 INFO L87 Difference]: Start difference. First operand 731 states and 1210 transitions. Second operand 3 states. [2019-09-10 08:59:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:59,964 INFO L93 Difference]: Finished difference Result 1225 states and 2027 transitions. [2019-09-10 08:59:59,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:59,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:59:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:59,972 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 08:59:59,972 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 08:59:59,973 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:59:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 08:59:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2019-09-10 08:59:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-10 08:59:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2026 transitions. [2019-09-10 08:59:59,998 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2026 transitions. Word has length 128 [2019-09-10 08:59:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:59:59,999 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 2026 transitions. [2019-09-10 08:59:59,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:59:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2026 transitions. [2019-09-10 09:00:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 09:00:00,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:00,002 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] [2019-09-10 09:00:00,002 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:00,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash 649173988, now seen corresponding path program 1 times [2019-09-10 09:00:00,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:00,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:00,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:00,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:00,155 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 09:00:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:00,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:00,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:00,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:00,158 INFO L87 Difference]: Start difference. First operand 1223 states and 2026 transitions. Second operand 3 states. [2019-09-10 09:00:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:00,207 INFO L93 Difference]: Finished difference Result 2169 states and 3583 transitions. [2019-09-10 09:00:00,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:00,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 09:00:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:00,219 INFO L225 Difference]: With dead ends: 2169 [2019-09-10 09:00:00,220 INFO L226 Difference]: Without dead ends: 2169 [2019-09-10 09:00:00,220 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 09:00:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-10 09:00:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2167. [2019-09-10 09:00:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-09-10 09:00:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3582 transitions. [2019-09-10 09:00:00,279 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3582 transitions. Word has length 131 [2019-09-10 09:00:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:00,280 INFO L475 AbstractCegarLoop]: Abstraction has 2167 states and 3582 transitions. [2019-09-10 09:00:00,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3582 transitions. [2019-09-10 09:00:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 09:00:00,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:00,286 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 09:00:00,287 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1855611538, now seen corresponding path program 1 times [2019-09-10 09:00:00,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:00,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:00,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:00,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:00,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:00,586 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 09:00:00,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:00,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:00:00,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:00,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:00:00,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:00:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:00:00,588 INFO L87 Difference]: Start difference. First operand 2167 states and 3582 transitions. Second operand 6 states. [2019-09-10 09:00:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:00,943 INFO L93 Difference]: Finished difference Result 6263 states and 10406 transitions. [2019-09-10 09:00:00,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:00:00,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 09:00:00,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:00,973 INFO L225 Difference]: With dead ends: 6263 [2019-09-10 09:00:00,973 INFO L226 Difference]: Without dead ends: 6263 [2019-09-10 09:00:00,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:00:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-10 09:00:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 4929. [2019-09-10 09:00:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4929 states. [2019-09-10 09:00:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8167 transitions. [2019-09-10 09:00:01,091 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8167 transitions. Word has length 134 [2019-09-10 09:00:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:01,091 INFO L475 AbstractCegarLoop]: Abstraction has 4929 states and 8167 transitions. [2019-09-10 09:00:01,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:00:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8167 transitions. [2019-09-10 09:00:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 09:00:01,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:01,096 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] [2019-09-10 09:00:01,096 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:01,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:01,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551114, now seen corresponding path program 1 times [2019-09-10 09:00:01,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:01,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:01,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:01,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:01,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:01,255 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 09:00:01,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:01,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:01,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:01,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:01,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:01,258 INFO L87 Difference]: Start difference. First operand 4929 states and 8167 transitions. Second operand 4 states. [2019-09-10 09:00:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:01,411 INFO L93 Difference]: Finished difference Result 8327 states and 13848 transitions. [2019-09-10 09:00:01,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:01,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 09:00:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:01,462 INFO L225 Difference]: With dead ends: 8327 [2019-09-10 09:00:01,462 INFO L226 Difference]: Without dead ends: 8327 [2019-09-10 09:00:01,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-09-10 09:00:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7273. [2019-09-10 09:00:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-10 09:00:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 12070 transitions. [2019-09-10 09:00:01,770 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 12070 transitions. Word has length 135 [2019-09-10 09:00:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:01,772 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 12070 transitions. [2019-09-10 09:00:01,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 12070 transitions. [2019-09-10 09:00:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 09:00:01,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:01,788 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 09:00:01,790 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1365624242, now seen corresponding path program 1 times [2019-09-10 09:00:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:01,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:01,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:01,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:01,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:02,072 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 09:00:02,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:02,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:02,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:02,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:02,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:02,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:02,075 INFO L87 Difference]: Start difference. First operand 7273 states and 12070 transitions. Second operand 3 states. [2019-09-10 09:00:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:02,184 INFO L93 Difference]: Finished difference Result 11099 states and 18426 transitions. [2019-09-10 09:00:02,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:02,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 09:00:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:02,283 INFO L225 Difference]: With dead ends: 11099 [2019-09-10 09:00:02,283 INFO L226 Difference]: Without dead ends: 11099 [2019-09-10 09:00:02,283 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 09:00:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2019-09-10 09:00:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 11097. [2019-09-10 09:00:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-09-10 09:00:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 18425 transitions. [2019-09-10 09:00:02,560 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 18425 transitions. Word has length 136 [2019-09-10 09:00:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:02,561 INFO L475 AbstractCegarLoop]: Abstraction has 11097 states and 18425 transitions. [2019-09-10 09:00:02,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 18425 transitions. [2019-09-10 09:00:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 09:00:02,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:02,564 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 09:00:02,564 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1188137794, now seen corresponding path program 1 times [2019-09-10 09:00:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:02,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:02,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:02,688 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 09:00:02,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:02,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:02,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:02,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:02,691 INFO L87 Difference]: Start difference. First operand 11097 states and 18425 transitions. Second operand 3 states. [2019-09-10 09:00:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:02,846 INFO L93 Difference]: Finished difference Result 15670 states and 25957 transitions. [2019-09-10 09:00:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:02,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 09:00:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:02,881 INFO L225 Difference]: With dead ends: 15670 [2019-09-10 09:00:02,881 INFO L226 Difference]: Without dead ends: 15670 [2019-09-10 09:00:02,882 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 09:00:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2019-09-10 09:00:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15668. [2019-09-10 09:00:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-09-10 09:00:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25956 transitions. [2019-09-10 09:00:03,155 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25956 transitions. Word has length 136 [2019-09-10 09:00:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:03,156 INFO L475 AbstractCegarLoop]: Abstraction has 15668 states and 25956 transitions. [2019-09-10 09:00:03,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25956 transitions. [2019-09-10 09:00:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 09:00:03,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:03,161 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 09:00:03,161 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1350880053, now seen corresponding path program 1 times [2019-09-10 09:00:03,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:03,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:03,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:03,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:03,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 09:00:03,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:03,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:03,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:03,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:03,364 INFO L87 Difference]: Start difference. First operand 15668 states and 25956 transitions. Second operand 4 states. [2019-09-10 09:00:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:03,565 INFO L93 Difference]: Finished difference Result 26712 states and 44251 transitions. [2019-09-10 09:00:03,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:03,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 09:00:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:03,641 INFO L225 Difference]: With dead ends: 26712 [2019-09-10 09:00:03,642 INFO L226 Difference]: Without dead ends: 26712 [2019-09-10 09:00:03,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26712 states. [2019-09-10 09:00:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26712 to 23307. [2019-09-10 09:00:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23307 states. [2019-09-10 09:00:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 38542 transitions. [2019-09-10 09:00:04,273 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 38542 transitions. Word has length 136 [2019-09-10 09:00:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:04,274 INFO L475 AbstractCegarLoop]: Abstraction has 23307 states and 38542 transitions. [2019-09-10 09:00:04,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 38542 transitions. [2019-09-10 09:00:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 09:00:04,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:04,276 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 09:00:04,277 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash -788578752, now seen corresponding path program 1 times [2019-09-10 09:00:04,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:04,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:04,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:04,390 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 09:00:04,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:04,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:04,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:04,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:04,395 INFO L87 Difference]: Start difference. First operand 23307 states and 38542 transitions. Second operand 3 states. [2019-09-10 09:00:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:04,560 INFO L93 Difference]: Finished difference Result 33980 states and 56028 transitions. [2019-09-10 09:00:04,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:04,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 09:00:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:04,644 INFO L225 Difference]: With dead ends: 33980 [2019-09-10 09:00:04,644 INFO L226 Difference]: Without dead ends: 33980 [2019-09-10 09:00:04,646 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 09:00:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33980 states. [2019-09-10 09:00:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33980 to 33978. [2019-09-10 09:00:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33978 states. [2019-09-10 09:00:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33978 states to 33978 states and 56027 transitions. [2019-09-10 09:00:05,866 INFO L78 Accepts]: Start accepts. Automaton has 33978 states and 56027 transitions. Word has length 136 [2019-09-10 09:00:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:05,867 INFO L475 AbstractCegarLoop]: Abstraction has 33978 states and 56027 transitions. [2019-09-10 09:00:05,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33978 states and 56027 transitions. [2019-09-10 09:00:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 09:00:05,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:05,869 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 09:00:05,870 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -783429068, now seen corresponding path program 1 times [2019-09-10 09:00:05,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:05,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:05,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:05,964 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 09:00:05,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:05,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:05,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:05,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:05,966 INFO L87 Difference]: Start difference. First operand 33978 states and 56027 transitions. Second operand 3 states. [2019-09-10 09:00:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:06,173 INFO L93 Difference]: Finished difference Result 50517 states and 82988 transitions. [2019-09-10 09:00:06,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:06,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 09:00:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:06,512 INFO L225 Difference]: With dead ends: 50517 [2019-09-10 09:00:06,513 INFO L226 Difference]: Without dead ends: 50517 [2019-09-10 09:00:06,513 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 09:00:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50517 states. [2019-09-10 09:00:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50517 to 50515. [2019-09-10 09:00:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-10 09:00:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 82987 transitions. [2019-09-10 09:00:08,702 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 82987 transitions. Word has length 136 [2019-09-10 09:00:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:08,703 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 82987 transitions. [2019-09-10 09:00:08,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 82987 transitions. [2019-09-10 09:00:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 09:00:08,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:08,705 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] [2019-09-10 09:00:08,705 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:08,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:08,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1129443555, now seen corresponding path program 1 times [2019-09-10 09:00:08,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:08,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:08,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:08,855 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 09:00:08,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:08,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:00:08,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:08,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:00:08,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:00:08,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:00:08,857 INFO L87 Difference]: Start difference. First operand 50515 states and 82987 transitions. Second operand 7 states. [2019-09-10 09:00:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:09,927 INFO L93 Difference]: Finished difference Result 185545 states and 303013 transitions. [2019-09-10 09:00:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 09:00:09,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 09:00:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:10,425 INFO L225 Difference]: With dead ends: 185545 [2019-09-10 09:00:10,425 INFO L226 Difference]: Without dead ends: 185545 [2019-09-10 09:00:10,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 09:00:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185545 states. [2019-09-10 09:00:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185545 to 140538. [2019-09-10 09:00:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140538 states. [2019-09-10 09:00:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140538 states to 140538 states and 228866 transitions. [2019-09-10 09:00:14,656 INFO L78 Accepts]: Start accepts. Automaton has 140538 states and 228866 transitions. Word has length 137 [2019-09-10 09:00:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:14,656 INFO L475 AbstractCegarLoop]: Abstraction has 140538 states and 228866 transitions. [2019-09-10 09:00:14,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:00:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 140538 states and 228866 transitions. [2019-09-10 09:00:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 09:00:14,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:14,659 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 09:00:14,660 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:14,660 INFO L82 PathProgramCache]: Analyzing trace with hash -705506052, now seen corresponding path program 1 times [2019-09-10 09:00:14,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:14,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:14,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:14,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:14,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:14,768 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 09:00:14,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:14,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:14,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:14,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:14,770 INFO L87 Difference]: Start difference. First operand 140538 states and 228866 transitions. Second operand 4 states. [2019-09-10 09:00:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:15,934 INFO L93 Difference]: Finished difference Result 274270 states and 446077 transitions. [2019-09-10 09:00:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:15,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 09:00:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:16,556 INFO L225 Difference]: With dead ends: 274270 [2019-09-10 09:00:16,556 INFO L226 Difference]: Without dead ends: 274270 [2019-09-10 09:00:16,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:00:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274270 states. [2019-09-10 09:00:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274270 to 206995. [2019-09-10 09:00:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206995 states. [2019-09-10 09:00:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206995 states to 206995 states and 336271 transitions. [2019-09-10 09:00:22,608 INFO L78 Accepts]: Start accepts. Automaton has 206995 states and 336271 transitions. Word has length 138 [2019-09-10 09:00:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:22,608 INFO L475 AbstractCegarLoop]: Abstraction has 206995 states and 336271 transitions. [2019-09-10 09:00:22,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 206995 states and 336271 transitions. [2019-09-10 09:00:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 09:00:22,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:22,610 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 09:00:22,610 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:22,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:22,611 INFO L82 PathProgramCache]: Analyzing trace with hash -876112340, now seen corresponding path program 1 times [2019-09-10 09:00:22,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:22,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:22,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:22,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:22,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:22,948 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 09:00:22,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:22,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:00:22,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:22,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:00:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:00:22,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:00:22,950 INFO L87 Difference]: Start difference. First operand 206995 states and 336271 transitions. Second operand 6 states. [2019-09-10 09:00:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:23,900 INFO L93 Difference]: Finished difference Result 298865 states and 485662 transitions. [2019-09-10 09:00:23,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:00:23,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 09:00:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:28,340 INFO L225 Difference]: With dead ends: 298865 [2019-09-10 09:00:28,340 INFO L226 Difference]: Without dead ends: 298865 [2019-09-10 09:00:28,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:00:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298865 states. [2019-09-10 09:00:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298865 to 236155. [2019-09-10 09:00:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236155 states. [2019-09-10 09:00:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236155 states to 236155 states and 382876 transitions. [2019-09-10 09:00:31,274 INFO L78 Accepts]: Start accepts. Automaton has 236155 states and 382876 transitions. Word has length 140 [2019-09-10 09:00:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:31,275 INFO L475 AbstractCegarLoop]: Abstraction has 236155 states and 382876 transitions. [2019-09-10 09:00:31,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:00:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 236155 states and 382876 transitions. [2019-09-10 09:00:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 09:00:31,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:31,276 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] [2019-09-10 09:00:31,276 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1795769074, now seen corresponding path program 1 times [2019-09-10 09:00:31,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:31,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:31,509 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 09:00:31,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:31,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:00:31,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:31,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:00:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:00:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:00:31,511 INFO L87 Difference]: Start difference. First operand 236155 states and 382876 transitions. Second operand 6 states. [2019-09-10 09:00:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:32,615 INFO L93 Difference]: Finished difference Result 436607 states and 708162 transitions. [2019-09-10 09:00:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:00:32,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 09:00:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:37,900 INFO L225 Difference]: With dead ends: 436607 [2019-09-10 09:00:37,900 INFO L226 Difference]: Without dead ends: 436607 [2019-09-10 09:00:37,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:00:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436607 states. [2019-09-10 09:00:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436607 to 420187. [2019-09-10 09:00:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420187 states. [2019-09-10 09:00:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420187 states to 420187 states and 680963 transitions. [2019-09-10 09:00:43,432 INFO L78 Accepts]: Start accepts. Automaton has 420187 states and 680963 transitions. Word has length 143 [2019-09-10 09:00:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:43,432 INFO L475 AbstractCegarLoop]: Abstraction has 420187 states and 680963 transitions. [2019-09-10 09:00:43,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:00:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 420187 states and 680963 transitions. [2019-09-10 09:00:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 09:00:43,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:43,434 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 09:00:43,434 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash 163824457, now seen corresponding path program 1 times [2019-09-10 09:00:43,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:43,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:43,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:43,605 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 09:00:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:43,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:00:43,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:43,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:00:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:00:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:00:43,607 INFO L87 Difference]: Start difference. First operand 420187 states and 680963 transitions. Second operand 5 states. [2019-09-10 09:00:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:53,221 INFO L93 Difference]: Finished difference Result 704201 states and 1133907 transitions. [2019-09-10 09:00:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:00:53,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 09:00:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:54,249 INFO L225 Difference]: With dead ends: 704201 [2019-09-10 09:00:54,249 INFO L226 Difference]: Without dead ends: 704201 [2019-09-10 09:00:54,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:00:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704201 states. [2019-09-10 09:01:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704201 to 426099. [2019-09-10 09:01:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426099 states. [2019-09-10 09:01:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426099 states to 426099 states and 686830 transitions. [2019-09-10 09:01:01,468 INFO L78 Accepts]: Start accepts. Automaton has 426099 states and 686830 transitions. Word has length 144 [2019-09-10 09:01:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:01,469 INFO L475 AbstractCegarLoop]: Abstraction has 426099 states and 686830 transitions. [2019-09-10 09:01:01,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:01:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 426099 states and 686830 transitions. [2019-09-10 09:01:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 09:01:01,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:01,478 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 09:01:01,479 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 537249617, now seen corresponding path program 1 times [2019-09-10 09:01:01,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:02,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:02,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:01:02,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 09:01:02,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 09:01:02,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2019-09-10 09:01:02,897 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [252], [255], [258], [261], [265], [268], [290], [293], [296], [298], [300], [335], [370], [405], [408], [411], [414], [417], [420], [427], [435], [437], [440], [441], [443], [452], [455], [466], [469], [481], [499], [502], [548], [558], [568], [578], [598], [601], [647], [657], [667], [677], [697], [700], [746], [756], [766], [776], [786], [790], [794], [796], [799], [845], [855], [865], [875], [1504], [1505], [1509], [1510], [1511] [2019-09-10 09:01:02,968 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 09:01:02,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 09:01:03,247 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 09:01:03,834 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 09:01:03,837 INFO L272 AbstractInterpreter]: Visited 151 different actions 402 times. Merged at 47 different actions 236 times. Widened at 24 different actions 25 times. Performed 1495 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1495 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 297 variables. [2019-09-10 09:01:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:03,843 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 09:01:04,709 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 88.03% of their original sizes. [2019-09-10 09:01:04,709 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 09:01:42,990 INFO L420 sIntCurrentIteration]: We unified 177 AI predicates to 177 [2019-09-10 09:01:42,990 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 09:01:42,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 09:01:42,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [111] imperfect sequences [5] total 114 [2019-09-10 09:01:42,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:42,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-10 09:01:42,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-10 09:01:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1789, Invalid=10421, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 09:01:42,997 INFO L87 Difference]: Start difference. First operand 426099 states and 686830 transitions. Second operand 111 states. [2019-09-10 09:06:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:44,183 INFO L93 Difference]: Finished difference Result 1864608 states and 2963410 transitions. [2019-09-10 09:06:44,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-10 09:06:44,183 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 178 [2019-09-10 09:06:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:47,958 INFO L225 Difference]: With dead ends: 1864608 [2019-09-10 09:06:47,958 INFO L226 Difference]: Without dead ends: 1864608 [2019-09-10 09:06:47,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18164 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=6380, Invalid=44020, Unknown=0, NotChecked=0, Total=50400 [2019-09-10 09:06:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864608 states. [2019-09-10 09:07:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864608 to 629478. [2019-09-10 09:07:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629478 states. [2019-09-10 09:07:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629478 states to 629478 states and 1013919 transitions. [2019-09-10 09:07:37,387 INFO L78 Accepts]: Start accepts. Automaton has 629478 states and 1013919 transitions. Word has length 178 [2019-09-10 09:07:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:37,388 INFO L475 AbstractCegarLoop]: Abstraction has 629478 states and 1013919 transitions. [2019-09-10 09:07:37,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-10 09:07:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 629478 states and 1013919 transitions. [2019-09-10 09:07:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 09:07:37,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:37,413 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 09:07:37,414 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:37,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash -374919044, now seen corresponding path program 1 times [2019-09-10 09:07:37,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:37,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:37,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:37,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:37,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:37,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:37,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:37,544 INFO L87 Difference]: Start difference. First operand 629478 states and 1013919 transitions. Second operand 3 states. [2019-09-10 09:07:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:50,406 INFO L93 Difference]: Finished difference Result 1234927 states and 1980547 transitions. [2019-09-10 09:07:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:50,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 09:07:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:53,701 INFO L225 Difference]: With dead ends: 1234927 [2019-09-10 09:07:53,701 INFO L226 Difference]: Without dead ends: 1234927 [2019-09-10 09:07:53,701 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 09:07:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234927 states. [2019-09-10 09:08:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234927 to 1234925. [2019-09-10 09:08:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234925 states. [2019-09-10 09:08:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234925 states to 1234925 states and 1980546 transitions. [2019-09-10 09:08:36,047 INFO L78 Accepts]: Start accepts. Automaton has 1234925 states and 1980546 transitions. Word has length 179 [2019-09-10 09:08:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:36,048 INFO L475 AbstractCegarLoop]: Abstraction has 1234925 states and 1980546 transitions. [2019-09-10 09:08:36,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:08:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1234925 states and 1980546 transitions. [2019-09-10 09:08:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 09:08:36,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:36,077 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 09:08:36,078 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1409800354, now seen corresponding path program 1 times [2019-09-10 09:08:36,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:36,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:36,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:36,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:36,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 09:08:36,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:36,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:08:36,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:36,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:08:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:08:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:08:36,267 INFO L87 Difference]: Start difference. First operand 1234925 states and 1980546 transitions. Second operand 6 states. [2019-09-10 09:08:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:52,613 INFO L93 Difference]: Finished difference Result 1411418 states and 2265611 transitions. [2019-09-10 09:08:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:08:52,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-10 09:08:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:56,803 INFO L225 Difference]: With dead ends: 1411418 [2019-09-10 09:08:56,803 INFO L226 Difference]: Without dead ends: 1411418 [2019-09-10 09:08:56,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:08:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411418 states. [2019-09-10 09:09:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411418 to 1332906. [2019-09-10 09:09:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332906 states.