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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:55:16,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:55:16,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:55:16,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:55:16,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:55:16,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:55:16,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:55:16,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:55:16,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:55:16,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:55:16,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:55:16,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:55:16,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:55:16,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:55:16,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:55:16,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:55:16,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:55:16,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:55:16,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:55:16,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:55:16,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:55:16,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:55:16,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:55:16,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:55:16,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:55:16,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:55:16,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:55:16,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:55:16,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:55:16,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:55:16,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:55:16,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:55:16,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:55:16,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:55:16,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:55:16,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:55:16,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:55:16,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:55:16,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:55:16,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:55:16,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:55:16,881 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:55:16,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:55:16,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:55:16,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:55:16,897 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:55:16,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:55:16,898 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:55:16,898 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:55:16,898 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:55:16,899 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:55:16,899 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:55:16,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:55:16,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:55:16,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:55:16,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:55:16,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:55:16,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:55:16,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:55:16,901 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:55:16,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:55:16,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:55:16,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:55:16,901 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:55:16,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:55:16,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:55:16,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:55:16,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:55:16,902 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:55:16,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:55:16,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:55:16,903 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:55:16,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:55:16,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:55:16,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:55:16,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:55:16,949 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:55:16,949 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:55:17,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec4fa1d7/36a24313d03843ab88bc33dd1fe7bee9/FLAG94808b24c [2019-09-10 08:55:17,682 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:55:17,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:55:17,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec4fa1d7/36a24313d03843ab88bc33dd1fe7bee9/FLAG94808b24c [2019-09-10 08:55:17,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec4fa1d7/36a24313d03843ab88bc33dd1fe7bee9 [2019-09-10 08:55:17,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:55:17,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:55:17,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:17,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:55:17,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:55:17,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:17" (1/1) ... [2019-09-10 08:55:17,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8f9913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:17, skipping insertion in model container [2019-09-10 08:55:17,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:17" (1/1) ... [2019-09-10 08:55:17,883 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:55:17,987 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:55:18,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:18,974 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:55:19,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:19,448 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:55:19,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19 WrapperNode [2019-09-10 08:55:19,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:19,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:55:19,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:55:19,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:55:19,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (1/1) ... [2019-09-10 08:55:19,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (1/1) ... [2019-09-10 08:55:19,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (1/1) ... [2019-09-10 08:55:19,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (1/1) ... [2019-09-10 08:55:19,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (1/1) ... [2019-09-10 08:55:19,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (1/1) ... [2019-09-10 08:55:19,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (1/1) ... [2019-09-10 08:55:19,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:55:19,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:55:19,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:55:19,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:55:19,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (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:55:19,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:55:19,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:55:19,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:55:19,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:55:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:55:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:55:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:55:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:55:19,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:55:19,702 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:55:19,702 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:55:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:55:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:55:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:55:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:55:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:55:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:55:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:55:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:55:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:55:22,371 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:55:22,372 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:55:22,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:55:22 BoogieIcfgContainer [2019-09-10 08:55:22,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:55:22,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:55:22,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:55:22,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:55:22,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:55:17" (1/3) ... [2019-09-10 08:55:22,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e48e188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:55:22, skipping insertion in model container [2019-09-10 08:55:22,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:19" (2/3) ... [2019-09-10 08:55:22,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e48e188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:55:22, skipping insertion in model container [2019-09-10 08:55:22,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:55:22" (3/3) ... [2019-09-10 08:55:22,423 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:55:22,436 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:55:22,466 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:55:22,486 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:55:22,519 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:55:22,519 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:55:22,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:55:22,520 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:55:22,520 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:55:22,520 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:55:22,520 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:55:22,520 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:55:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states. [2019-09-10 08:55:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:55:22,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:22,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,628 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:22,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1949460245, now seen corresponding path program 1 times [2019-09-10 08:55:22,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:22,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:23,612 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:55:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:23,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:23,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:23,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:23,642 INFO L87 Difference]: Start difference. First operand 808 states. Second operand 3 states. [2019-09-10 08:55:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:24,056 INFO L93 Difference]: Finished difference Result 1319 states and 2324 transitions. [2019-09-10 08:55:24,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:24,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:55:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:24,112 INFO L225 Difference]: With dead ends: 1319 [2019-09-10 08:55:24,112 INFO L226 Difference]: Without dead ends: 1311 [2019-09-10 08:55:24,114 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:55:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-09-10 08:55:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1309. [2019-09-10 08:55:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-10 08:55:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 2040 transitions. [2019-09-10 08:55:24,242 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 2040 transitions. Word has length 330 [2019-09-10 08:55:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:24,244 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 2040 transitions. [2019-09-10 08:55:24,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2040 transitions. [2019-09-10 08:55:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:55:24,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:24,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:24,255 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1160300407, now seen corresponding path program 1 times [2019-09-10 08:55:24,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:24,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:24,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:24,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:24,648 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:55:24,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:24,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:24,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:24,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:24,652 INFO L87 Difference]: Start difference. First operand 1309 states and 2040 transitions. Second operand 3 states. [2019-09-10 08:55:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:24,833 INFO L93 Difference]: Finished difference Result 2261 states and 3513 transitions. [2019-09-10 08:55:24,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:24,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:55:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:24,853 INFO L225 Difference]: With dead ends: 2261 [2019-09-10 08:55:24,853 INFO L226 Difference]: Without dead ends: 2261 [2019-09-10 08:55:24,854 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:55:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-09-10 08:55:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2259. [2019-09-10 08:55:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-09-10 08:55:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3512 transitions. [2019-09-10 08:55:24,933 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3512 transitions. Word has length 330 [2019-09-10 08:55:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:24,934 INFO L475 AbstractCegarLoop]: Abstraction has 2259 states and 3512 transitions. [2019-09-10 08:55:24,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3512 transitions. [2019-09-10 08:55:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:55:24,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:24,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:24,946 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1989837066, now seen corresponding path program 1 times [2019-09-10 08:55:24,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:24,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:24,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:25,941 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:55:25,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:25,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:25,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:25,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:25,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:25,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:25,944 INFO L87 Difference]: Start difference. First operand 2259 states and 3512 transitions. Second operand 4 states. [2019-09-10 08:55:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:26,170 INFO L93 Difference]: Finished difference Result 4426 states and 6839 transitions. [2019-09-10 08:55:26,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:26,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-10 08:55:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:26,202 INFO L225 Difference]: With dead ends: 4426 [2019-09-10 08:55:26,202 INFO L226 Difference]: Without dead ends: 4426 [2019-09-10 08:55:26,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2019-09-10 08:55:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4424. [2019-09-10 08:55:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-09-10 08:55:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 6838 transitions. [2019-09-10 08:55:26,350 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 6838 transitions. Word has length 330 [2019-09-10 08:55:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:26,350 INFO L475 AbstractCegarLoop]: Abstraction has 4424 states and 6838 transitions. [2019-09-10 08:55:26,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6838 transitions. [2019-09-10 08:55:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:55:26,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:26,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:26,366 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash -703078163, now seen corresponding path program 1 times [2019-09-10 08:55:26,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:26,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:26,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:26,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:26,664 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:55:26,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:26,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:26,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:26,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:26,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:26,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:26,667 INFO L87 Difference]: Start difference. First operand 4424 states and 6838 transitions. Second operand 3 states. [2019-09-10 08:55:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:26,866 INFO L93 Difference]: Finished difference Result 8676 states and 13332 transitions. [2019-09-10 08:55:26,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:26,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:55:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:26,987 INFO L225 Difference]: With dead ends: 8676 [2019-09-10 08:55:26,987 INFO L226 Difference]: Without dead ends: 8676 [2019-09-10 08:55:26,988 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:55:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8676 states. [2019-09-10 08:55:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8676 to 8674. [2019-09-10 08:55:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-09-10 08:55:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 13331 transitions. [2019-09-10 08:55:27,319 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 13331 transitions. Word has length 332 [2019-09-10 08:55:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:27,320 INFO L475 AbstractCegarLoop]: Abstraction has 8674 states and 13331 transitions. [2019-09-10 08:55:27,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 13331 transitions. [2019-09-10 08:55:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:55:27,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:27,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,357 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:27,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:27,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1582910286, now seen corresponding path program 1 times [2019-09-10 08:55:27,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:27,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:27,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:27,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:27,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:27,591 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:55:27,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:27,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:27,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:27,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:27,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:27,595 INFO L87 Difference]: Start difference. First operand 8674 states and 13331 transitions. Second operand 3 states. [2019-09-10 08:55:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:27,790 INFO L93 Difference]: Finished difference Result 17315 states and 26602 transitions. [2019-09-10 08:55:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:27,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:55:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:27,879 INFO L225 Difference]: With dead ends: 17315 [2019-09-10 08:55:27,879 INFO L226 Difference]: Without dead ends: 17315 [2019-09-10 08:55:27,880 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:55:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17315 states. [2019-09-10 08:55:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17315 to 8693. [2019-09-10 08:55:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-09-10 08:55:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 13359 transitions. [2019-09-10 08:55:28,287 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 13359 transitions. Word has length 332 [2019-09-10 08:55:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:28,288 INFO L475 AbstractCegarLoop]: Abstraction has 8693 states and 13359 transitions. [2019-09-10 08:55:28,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 13359 transitions. [2019-09-10 08:55:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 08:55:28,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:28,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:28,312 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1625546102, now seen corresponding path program 1 times [2019-09-10 08:55:28,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:28,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:28,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:28,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:28,543 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:55:28,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:28,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:28,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:28,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:28,546 INFO L87 Difference]: Start difference. First operand 8693 states and 13359 transitions. Second operand 3 states. [2019-09-10 08:55:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:28,671 INFO L93 Difference]: Finished difference Result 17333 states and 26623 transitions. [2019-09-10 08:55:28,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:28,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-10 08:55:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:28,718 INFO L225 Difference]: With dead ends: 17333 [2019-09-10 08:55:28,718 INFO L226 Difference]: Without dead ends: 17333 [2019-09-10 08:55:28,719 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:55:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2019-09-10 08:55:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 8711. [2019-09-10 08:55:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8711 states. [2019-09-10 08:55:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 13380 transitions. [2019-09-10 08:55:29,127 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 13380 transitions. Word has length 333 [2019-09-10 08:55:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:29,129 INFO L475 AbstractCegarLoop]: Abstraction has 8711 states and 13380 transitions. [2019-09-10 08:55:29,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 13380 transitions. [2019-09-10 08:55:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:55:29,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:29,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:29,168 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2091419944, now seen corresponding path program 1 times [2019-09-10 08:55:29,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:29,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:29,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:29,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:29,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:29,619 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:55:29,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:29,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:29,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:29,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:29,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:29,622 INFO L87 Difference]: Start difference. First operand 8711 states and 13380 transitions. Second operand 3 states. [2019-09-10 08:55:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:29,781 INFO L93 Difference]: Finished difference Result 16988 states and 25917 transitions. [2019-09-10 08:55:29,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:29,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 08:55:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:29,819 INFO L225 Difference]: With dead ends: 16988 [2019-09-10 08:55:29,819 INFO L226 Difference]: Without dead ends: 16988 [2019-09-10 08:55:29,820 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:55:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16988 states. [2019-09-10 08:55:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16988 to 16986. [2019-09-10 08:55:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16986 states. [2019-09-10 08:55:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 25916 transitions. [2019-09-10 08:55:30,188 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 25916 transitions. Word has length 334 [2019-09-10 08:55:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:30,189 INFO L475 AbstractCegarLoop]: Abstraction has 16986 states and 25916 transitions. [2019-09-10 08:55:30,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 25916 transitions. [2019-09-10 08:55:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:55:30,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:30,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,227 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -7020987, now seen corresponding path program 1 times [2019-09-10 08:55:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:30,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:30,815 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:55:30,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:30,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:30,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:30,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:30,820 INFO L87 Difference]: Start difference. First operand 16986 states and 25916 transitions. Second operand 4 states. [2019-09-10 08:55:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:31,028 INFO L93 Difference]: Finished difference Result 31660 states and 48192 transitions. [2019-09-10 08:55:31,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:31,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-10 08:55:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:31,805 INFO L225 Difference]: With dead ends: 31660 [2019-09-10 08:55:31,805 INFO L226 Difference]: Without dead ends: 31660 [2019-09-10 08:55:31,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31660 states. [2019-09-10 08:55:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31660 to 17221. [2019-09-10 08:55:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17221 states. [2019-09-10 08:55:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17221 states to 17221 states and 26304 transitions. [2019-09-10 08:55:32,286 INFO L78 Accepts]: Start accepts. Automaton has 17221 states and 26304 transitions. Word has length 334 [2019-09-10 08:55:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:32,286 INFO L475 AbstractCegarLoop]: Abstraction has 17221 states and 26304 transitions. [2019-09-10 08:55:32,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 17221 states and 26304 transitions. [2019-09-10 08:55:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:55:32,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:32,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:32,324 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash -154461326, now seen corresponding path program 1 times [2019-09-10 08:55:32,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:32,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:32,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:32,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:32,506 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:55:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:32,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:32,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:32,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:32,508 INFO L87 Difference]: Start difference. First operand 17221 states and 26304 transitions. Second operand 3 states. [2019-09-10 08:55:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:32,688 INFO L93 Difference]: Finished difference Result 26695 states and 41069 transitions. [2019-09-10 08:55:32,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:32,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 08:55:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:32,766 INFO L225 Difference]: With dead ends: 26695 [2019-09-10 08:55:32,766 INFO L226 Difference]: Without dead ends: 26695 [2019-09-10 08:55:32,768 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:55:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26695 states. [2019-09-10 08:55:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26695 to 21285. [2019-09-10 08:55:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21285 states. [2019-09-10 08:55:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21285 states to 21285 states and 33004 transitions. [2019-09-10 08:55:33,388 INFO L78 Accepts]: Start accepts. Automaton has 21285 states and 33004 transitions. Word has length 336 [2019-09-10 08:55:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:33,388 INFO L475 AbstractCegarLoop]: Abstraction has 21285 states and 33004 transitions. [2019-09-10 08:55:33,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21285 states and 33004 transitions. [2019-09-10 08:55:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:55:33,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:33,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,428 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:33,429 INFO L82 PathProgramCache]: Analyzing trace with hash -106139639, now seen corresponding path program 1 times [2019-09-10 08:55:33,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:33,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:33,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:33,593 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:55:33,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:33,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:33,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:33,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:33,602 INFO L87 Difference]: Start difference. First operand 21285 states and 33004 transitions. Second operand 3 states. [2019-09-10 08:55:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:33,746 INFO L93 Difference]: Finished difference Result 41803 states and 64652 transitions. [2019-09-10 08:55:33,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:33,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 08:55:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:33,835 INFO L225 Difference]: With dead ends: 41803 [2019-09-10 08:55:33,836 INFO L226 Difference]: Without dead ends: 41803 [2019-09-10 08:55:33,836 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:55:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41803 states. [2019-09-10 08:55:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41803 to 21389. [2019-09-10 08:55:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21389 states. [2019-09-10 08:55:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 33147 transitions. [2019-09-10 08:55:34,485 INFO L78 Accepts]: Start accepts. Automaton has 21389 states and 33147 transitions. Word has length 336 [2019-09-10 08:55:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:34,486 INFO L475 AbstractCegarLoop]: Abstraction has 21389 states and 33147 transitions. [2019-09-10 08:55:34,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21389 states and 33147 transitions. [2019-09-10 08:55:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 08:55:34,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:34,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,528 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash 921486183, now seen corresponding path program 1 times [2019-09-10 08:55:34,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:34,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:34,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:34,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:35,422 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:55:35,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:35,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:35,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:35,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:35,424 INFO L87 Difference]: Start difference. First operand 21389 states and 33147 transitions. Second operand 3 states. [2019-09-10 08:55:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:35,570 INFO L93 Difference]: Finished difference Result 41928 states and 64798 transitions. [2019-09-10 08:55:35,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:35,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-10 08:55:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:35,662 INFO L225 Difference]: With dead ends: 41928 [2019-09-10 08:55:35,662 INFO L226 Difference]: Without dead ends: 41928 [2019-09-10 08:55:35,663 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:55:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41928 states. [2019-09-10 08:55:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41928 to 21514. [2019-09-10 08:55:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21514 states. [2019-09-10 08:55:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21514 states to 21514 states and 33293 transitions. [2019-09-10 08:55:36,220 INFO L78 Accepts]: Start accepts. Automaton has 21514 states and 33293 transitions. Word has length 337 [2019-09-10 08:55:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:36,220 INFO L475 AbstractCegarLoop]: Abstraction has 21514 states and 33293 transitions. [2019-09-10 08:55:36,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 21514 states and 33293 transitions. [2019-09-10 08:55:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 08:55:36,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:36,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:36,244 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash -936344161, now seen corresponding path program 1 times [2019-09-10 08:55:36,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:36,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:36,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:36,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:36,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:36,442 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:55:36,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:36,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:36,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:36,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:36,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:36,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:36,444 INFO L87 Difference]: Start difference. First operand 21514 states and 33293 transitions. Second operand 3 states. [2019-09-10 08:55:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:36,634 INFO L93 Difference]: Finished difference Result 33260 states and 51786 transitions. [2019-09-10 08:55:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:36,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-09-10 08:55:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:36,685 INFO L225 Difference]: With dead ends: 33260 [2019-09-10 08:55:36,685 INFO L226 Difference]: Without dead ends: 33260 [2019-09-10 08:55:36,686 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:55:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33260 states. [2019-09-10 08:55:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33260 to 28778. [2019-09-10 08:55:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28778 states. [2019-09-10 08:55:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28778 states to 28778 states and 45209 transitions. [2019-09-10 08:55:37,262 INFO L78 Accepts]: Start accepts. Automaton has 28778 states and 45209 transitions. Word has length 338 [2019-09-10 08:55:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:37,263 INFO L475 AbstractCegarLoop]: Abstraction has 28778 states and 45209 transitions. [2019-09-10 08:55:37,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 28778 states and 45209 transitions. [2019-09-10 08:55:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 08:55:37,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:37,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:37,284 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash -531089956, now seen corresponding path program 1 times [2019-09-10 08:55:37,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:37,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:37,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:37,642 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:55:37,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:37,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:37,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:37,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:37,645 INFO L87 Difference]: Start difference. First operand 28778 states and 45209 transitions. Second operand 4 states. [2019-09-10 08:55:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:37,747 INFO L93 Difference]: Finished difference Result 26184 states and 41080 transitions. [2019-09-10 08:55:37,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:37,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-09-10 08:55:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:37,779 INFO L225 Difference]: With dead ends: 26184 [2019-09-10 08:55:37,779 INFO L226 Difference]: Without dead ends: 25387 [2019-09-10 08:55:37,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25387 states. [2019-09-10 08:55:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25387 to 25367. [2019-09-10 08:55:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25367 states. [2019-09-10 08:55:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25367 states to 25367 states and 39813 transitions. [2019-09-10 08:55:38,175 INFO L78 Accepts]: Start accepts. Automaton has 25367 states and 39813 transitions. Word has length 338 [2019-09-10 08:55:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:38,175 INFO L475 AbstractCegarLoop]: Abstraction has 25367 states and 39813 transitions. [2019-09-10 08:55:38,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 25367 states and 39813 transitions. [2019-09-10 08:55:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-10 08:55:38,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:38,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,200 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1972395214, now seen corresponding path program 1 times [2019-09-10 08:55:38,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:38,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:38,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:38,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:38,697 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:55:38,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:38,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:55:38,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:38,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:55:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:55:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:55:38,700 INFO L87 Difference]: Start difference. First operand 25367 states and 39813 transitions. Second operand 8 states. [2019-09-10 08:55:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:41,877 INFO L93 Difference]: Finished difference Result 133708 states and 211885 transitions. [2019-09-10 08:55:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:55:41,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 339 [2019-09-10 08:55:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:42,034 INFO L225 Difference]: With dead ends: 133708 [2019-09-10 08:55:42,034 INFO L226 Difference]: Without dead ends: 133708 [2019-09-10 08:55:42,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:55:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133708 states. [2019-09-10 08:55:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133708 to 65842. [2019-09-10 08:55:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65842 states. [2019-09-10 08:55:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65842 states to 65842 states and 102884 transitions. [2019-09-10 08:55:43,546 INFO L78 Accepts]: Start accepts. Automaton has 65842 states and 102884 transitions. Word has length 339 [2019-09-10 08:55:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:43,546 INFO L475 AbstractCegarLoop]: Abstraction has 65842 states and 102884 transitions. [2019-09-10 08:55:43,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:55:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65842 states and 102884 transitions. [2019-09-10 08:55:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-10 08:55:43,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:43,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,584 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash 842249463, now seen corresponding path program 1 times [2019-09-10 08:55:43,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:43,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:43,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:43,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:43,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:44,129 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:55:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:44,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:55:44,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:44,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:55:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:55:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:55:44,132 INFO L87 Difference]: Start difference. First operand 65842 states and 102884 transitions. Second operand 10 states. [2019-09-10 08:55:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:46,859 INFO L93 Difference]: Finished difference Result 173751 states and 271884 transitions. [2019-09-10 08:55:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:55:46,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 339 [2019-09-10 08:55:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:49,005 INFO L225 Difference]: With dead ends: 173751 [2019-09-10 08:55:49,005 INFO L226 Difference]: Without dead ends: 173751 [2019-09-10 08:55:49,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:55:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173751 states. [2019-09-10 08:55:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173751 to 106907. [2019-09-10 08:55:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106907 states. [2019-09-10 08:55:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106907 states to 106907 states and 166544 transitions. [2019-09-10 08:55:50,663 INFO L78 Accepts]: Start accepts. Automaton has 106907 states and 166544 transitions. Word has length 339 [2019-09-10 08:55:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:50,663 INFO L475 AbstractCegarLoop]: Abstraction has 106907 states and 166544 transitions. [2019-09-10 08:55:50,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:55:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 106907 states and 166544 transitions. [2019-09-10 08:55:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-10 08:55:50,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:50,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,709 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1978603445, now seen corresponding path program 1 times [2019-09-10 08:55:50,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:50,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:50,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:50,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:50,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:51,189 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:55:51,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:51,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:51,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:51,193 INFO L87 Difference]: Start difference. First operand 106907 states and 166544 transitions. Second operand 4 states. [2019-09-10 08:55:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:51,764 INFO L93 Difference]: Finished difference Result 126917 states and 198359 transitions. [2019-09-10 08:55:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:51,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-09-10 08:55:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:51,972 INFO L225 Difference]: With dead ends: 126917 [2019-09-10 08:55:51,973 INFO L226 Difference]: Without dead ends: 126917 [2019-09-10 08:55:51,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 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 08:55:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126917 states. [2019-09-10 08:55:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126917 to 80433. [2019-09-10 08:55:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80433 states. [2019-09-10 08:55:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80433 states to 80433 states and 125918 transitions. [2019-09-10 08:55:55,829 INFO L78 Accepts]: Start accepts. Automaton has 80433 states and 125918 transitions. Word has length 339 [2019-09-10 08:55:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:55,829 INFO L475 AbstractCegarLoop]: Abstraction has 80433 states and 125918 transitions. [2019-09-10 08:55:55,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 80433 states and 125918 transitions. [2019-09-10 08:55:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-10 08:55:55,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:55,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,853 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:55,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:55,854 INFO L82 PathProgramCache]: Analyzing trace with hash 848457694, now seen corresponding path program 1 times [2019-09-10 08:55:55,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:55,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:55,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:56,484 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:55:56,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:56,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:56,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:56,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:56,486 INFO L87 Difference]: Start difference. First operand 80433 states and 125918 transitions. Second operand 4 states. [2019-09-10 08:55:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:57,043 INFO L93 Difference]: Finished difference Result 157461 states and 245350 transitions. [2019-09-10 08:55:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:57,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-09-10 08:55:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:57,228 INFO L225 Difference]: With dead ends: 157461 [2019-09-10 08:55:57,228 INFO L226 Difference]: Without dead ends: 157461 [2019-09-10 08:55:57,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157461 states. [2019-09-10 08:55:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157461 to 157459. [2019-09-10 08:55:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157459 states. [2019-09-10 08:55:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157459 states to 157459 states and 245349 transitions. [2019-09-10 08:55:59,482 INFO L78 Accepts]: Start accepts. Automaton has 157459 states and 245349 transitions. Word has length 339 [2019-09-10 08:55:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:59,482 INFO L475 AbstractCegarLoop]: Abstraction has 157459 states and 245349 transitions. [2019-09-10 08:55:59,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 157459 states and 245349 transitions. [2019-09-10 08:55:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-10 08:55:59,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:59,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,528 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:59,528 INFO L82 PathProgramCache]: Analyzing trace with hash -591706562, now seen corresponding path program 1 times [2019-09-10 08:55:59,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:59,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:59,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:59,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:59,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:59,761 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:55:59,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:59,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:59,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:59,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:59,763 INFO L87 Difference]: Start difference. First operand 157459 states and 245349 transitions. Second operand 3 states. [2019-09-10 08:56:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:00,530 INFO L93 Difference]: Finished difference Result 308317 states and 478841 transitions. [2019-09-10 08:56:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:00,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2019-09-10 08:56:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:00,924 INFO L225 Difference]: With dead ends: 308317 [2019-09-10 08:56:00,925 INFO L226 Difference]: Without dead ends: 308317 [2019-09-10 08:56:00,925 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:56:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308317 states. [2019-09-10 08:56:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308317 to 308315. [2019-09-10 08:56:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308315 states. [2019-09-10 08:56:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308315 states to 308315 states and 478840 transitions. [2019-09-10 08:56:08,771 INFO L78 Accepts]: Start accepts. Automaton has 308315 states and 478840 transitions. Word has length 341 [2019-09-10 08:56:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:08,772 INFO L475 AbstractCegarLoop]: Abstraction has 308315 states and 478840 transitions. [2019-09-10 08:56:08,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 308315 states and 478840 transitions. [2019-09-10 08:56:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-10 08:56:08,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:08,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,856 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -562766645, now seen corresponding path program 1 times [2019-09-10 08:56:08,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:08,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:08,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:09,075 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:56:09,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:09,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:09,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:09,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:09,078 INFO L87 Difference]: Start difference. First operand 308315 states and 478840 transitions. Second operand 3 states. [2019-09-10 08:56:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:15,564 INFO L93 Difference]: Finished difference Result 527133 states and 822449 transitions. [2019-09-10 08:56:15,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:15,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-09-10 08:56:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:16,460 INFO L225 Difference]: With dead ends: 527133 [2019-09-10 08:56:16,461 INFO L226 Difference]: Without dead ends: 527133 [2019-09-10 08:56:16,461 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:56:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527133 states. [2019-09-10 08:56:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527133 to 478523. [2019-09-10 08:56:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478523 states. [2019-09-10 08:56:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478523 states to 478523 states and 748912 transitions. [2019-09-10 08:56:31,670 INFO L78 Accepts]: Start accepts. Automaton has 478523 states and 748912 transitions. Word has length 342 [2019-09-10 08:56:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:31,670 INFO L475 AbstractCegarLoop]: Abstraction has 478523 states and 748912 transitions. [2019-09-10 08:56:31,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 478523 states and 748912 transitions. [2019-09-10 08:56:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-10 08:56:31,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:31,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,759 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash 212441379, now seen corresponding path program 1 times [2019-09-10 08:56:31,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:31,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:31,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:32,035 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:56:32,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:32,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:32,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:32,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:32,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:32,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:32,037 INFO L87 Difference]: Start difference. First operand 478523 states and 748912 transitions. Second operand 3 states. [2019-09-10 08:56:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:40,211 INFO L93 Difference]: Finished difference Result 939720 states and 1463076 transitions. [2019-09-10 08:56:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:40,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2019-09-10 08:56:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:42,619 INFO L225 Difference]: With dead ends: 939720 [2019-09-10 08:56:42,620 INFO L226 Difference]: Without dead ends: 939720 [2019-09-10 08:56:42,620 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:56:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939720 states. [2019-09-10 08:57:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939720 to 939718. [2019-09-10 08:57:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939718 states. [2019-09-10 08:57:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939718 states to 939718 states and 1463075 transitions. [2019-09-10 08:57:18,396 INFO L78 Accepts]: Start accepts. Automaton has 939718 states and 1463075 transitions. Word has length 343 [2019-09-10 08:57:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:18,396 INFO L475 AbstractCegarLoop]: Abstraction has 939718 states and 1463075 transitions. [2019-09-10 08:57:18,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 939718 states and 1463075 transitions. [2019-09-10 08:57:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-10 08:57:18,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:18,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:18,598 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 816167270, now seen corresponding path program 1 times [2019-09-10 08:57:18,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:18,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:18,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:19,027 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:57:19,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:19,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:19,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:19,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:19,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:19,030 INFO L87 Difference]: Start difference. First operand 939718 states and 1463075 transitions. Second operand 4 states. [2019-09-10 08:57:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:37,459 INFO L93 Difference]: Finished difference Result 1597888 states and 2481279 transitions. [2019-09-10 08:57:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:37,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 343 [2019-09-10 08:57:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:41,223 INFO L225 Difference]: With dead ends: 1597888 [2019-09-10 08:57:41,223 INFO L226 Difference]: Without dead ends: 1597888 [2019-09-10 08:57:41,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597888 states. [2019-09-10 08:58:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597888 to 910612. [2019-09-10 08:58:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910612 states. [2019-09-10 08:58:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910612 states to 910612 states and 1416685 transitions. [2019-09-10 08:58:28,314 INFO L78 Accepts]: Start accepts. Automaton has 910612 states and 1416685 transitions. Word has length 343 [2019-09-10 08:58:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:28,314 INFO L475 AbstractCegarLoop]: Abstraction has 910612 states and 1416685 transitions. [2019-09-10 08:58:28,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:58:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 910612 states and 1416685 transitions. [2019-09-10 08:58:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-10 08:58:28,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:28,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,489 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1907273686, now seen corresponding path program 1 times [2019-09-10 08:58:28,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:28,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:28,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:28,647 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:58:28,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:28,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:28,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:28,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:28,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:28,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:28,650 INFO L87 Difference]: Start difference. First operand 910612 states and 1416685 transitions. Second operand 3 states. [2019-09-10 08:58:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:41,194 INFO L93 Difference]: Finished difference Result 1634538 states and 2540543 transitions. [2019-09-10 08:58:52,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:58:52,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-09-10 08:58:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:55,381 INFO L225 Difference]: With dead ends: 1634538 [2019-09-10 08:58:55,381 INFO L226 Difference]: Without dead ends: 1634538 [2019-09-10 08:58:55,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634538 states. [2019-09-10 08:59:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634538 to 911093. [2019-09-10 08:59:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911093 states. [2019-09-10 08:59:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911093 states to 911093 states and 1417283 transitions. [2019-09-10 08:59:34,378 INFO L78 Accepts]: Start accepts. Automaton has 911093 states and 1417283 transitions. Word has length 346 [2019-09-10 08:59:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:59:34,378 INFO L475 AbstractCegarLoop]: Abstraction has 911093 states and 1417283 transitions. [2019-09-10 08:59:34,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:59:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 911093 states and 1417283 transitions. [2019-09-10 08:59:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-10 08:59:34,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:59:34,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,568 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:59:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:59:34,568 INFO L82 PathProgramCache]: Analyzing trace with hash 272593152, now seen corresponding path program 1 times [2019-09-10 08:59:34,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:59:34,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:59:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:59:34,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:34,760 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:34,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:34,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:59:34,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:34,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:59:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:59:34,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:34,763 INFO L87 Difference]: Start difference. First operand 911093 states and 1417283 transitions. Second operand 3 states. [2019-09-10 08:59:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:53,538 INFO L93 Difference]: Finished difference Result 1543591 states and 2414733 transitions. [2019-09-10 08:59:53,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:53,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-09-10 08:59:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:57,273 INFO L225 Difference]: With dead ends: 1543591 [2019-09-10 08:59:57,274 INFO L226 Difference]: Without dead ends: 1543591 [2019-09-10 08:59:57,274 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:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543591 states. [2019-09-10 09:00:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543591 to 1407701. [2019-09-10 09:00:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407701 states. [2019-09-10 09:00:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407701 states to 1407701 states and 2220044 transitions. [2019-09-10 09:00:54,989 INFO L78 Accepts]: Start accepts. Automaton has 1407701 states and 2220044 transitions. Word has length 347 [2019-09-10 09:00:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:54,989 INFO L475 AbstractCegarLoop]: Abstraction has 1407701 states and 2220044 transitions. [2019-09-10 09:00:54,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1407701 states and 2220044 transitions. [2019-09-10 09:00:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-10 09:00:55,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:55,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,166 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:55,166 INFO L82 PathProgramCache]: Analyzing trace with hash 743889042, now seen corresponding path program 1 times [2019-09-10 09:00:55,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:55,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:55,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:00:55,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:55,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:55,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:55,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:55,622 INFO L87 Difference]: Start difference. First operand 1407701 states and 2220044 transitions. Second operand 4 states.