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/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:31:50,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:31:50,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:31:50,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:31:50,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:31:50,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:31:50,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:31:50,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:31:50,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:31:50,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:31:50,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:31:50,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:31:50,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:31:50,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:31:50,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:31:50,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:31:50,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:31:50,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:31:50,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:31:50,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:31:50,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:31:50,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:31:50,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:31:50,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:31:50,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:31:50,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:31:50,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:31:50,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:31:50,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:31:50,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:31:50,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:31:50,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:31:50,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:31:50,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:31:50,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:31:50,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:31:50,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:31:50,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:31:50,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:31:50,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:31:50,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:31:50,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:31:50,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:31:50,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:31:50,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:31:50,891 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:31:50,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:31:50,892 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:31:50,892 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:31:50,892 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:31:50,892 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:31:50,892 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:31:50,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:31:50,893 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:31:50,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:31:50,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:31:50,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:31:50,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:31:50,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:31:50,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:31:50,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:31:50,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:31:50,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:31:50,895 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:31:50,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:31:50,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:31:50,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:31:50,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:31:50,897 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:31:50,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:31:50,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:31:50,898 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:31:50,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:31:50,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:31:50,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:31:50,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:31:50,974 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:31:50,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-09-20 13:31:51,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac2e66e9/d0a49093188e41ba8e7dc338d3ec56c7/FLAG77bee1636 [2019-09-20 13:31:51,499 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:31:51,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-09-20 13:31:51,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac2e66e9/d0a49093188e41ba8e7dc338d3ec56c7/FLAG77bee1636 [2019-09-20 13:31:51,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac2e66e9/d0a49093188e41ba8e7dc338d3ec56c7 [2019-09-20 13:31:51,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:31:51,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:31:51,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:51,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:31:51,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:31:51,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:51" (1/1) ... [2019-09-20 13:31:51,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da2ec92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:51, skipping insertion in model container [2019-09-20 13:31:51,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:51" (1/1) ... [2019-09-20 13:31:51,889 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:31:51,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:31:52,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:52,199 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:31:52,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:52,359 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:31:52,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52 WrapperNode [2019-09-20 13:31:52,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:52,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:31:52,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:31:52,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:31:52,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:31:52,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:31:52,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:31:52,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:31:52,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:31:52,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:31:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:31:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:31:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-09-20 13:31:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-09-20 13:31:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-09-20 13:31:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-09-20 13:31:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-09-20 13:31:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-09-20 13:31:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:31:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:31:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:31:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:31:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:31:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:31:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:31:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:31:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:31:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:31:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:31:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:31:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:31:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:31:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-09-20 13:31:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-09-20 13:31:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-09-20 13:31:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-09-20 13:31:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-09-20 13:31:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-09-20 13:31:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:31:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:31:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:31:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:31:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:31:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:31:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:31:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:31:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:31:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:31:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:31:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:31:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:31:52,983 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:31:52,983 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-20 13:31:52,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:31:52 BoogieIcfgContainer [2019-09-20 13:31:52,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:31:52,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:31:52,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:31:52,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:31:52,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:31:51" (1/3) ... [2019-09-20 13:31:52,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a32009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:31:52, skipping insertion in model container [2019-09-20 13:31:52,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (2/3) ... [2019-09-20 13:31:52,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a32009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:31:52, skipping insertion in model container [2019-09-20 13:31:52,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:31:52" (3/3) ... [2019-09-20 13:31:52,992 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-09-20 13:31:52,999 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:31:53,007 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:31:53,022 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:31:53,046 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:31:53,046 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:31:53,046 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:31:53,047 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:31:53,047 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:31:53,047 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:31:53,047 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:31:53,047 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:31:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-09-20 13:31:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:53,083 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:53,084 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:53,086 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:53,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 4101629, now seen corresponding path program 1 times [2019-09-20 13:31:53,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:53,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:53,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:53,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:53,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:53,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:53,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:53,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:53,478 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 5 states. [2019-09-20 13:31:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:54,261 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2019-09-20 13:31:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:54,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-20 13:31:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:54,291 INFO L225 Difference]: With dead ends: 268 [2019-09-20 13:31:54,291 INFO L226 Difference]: Without dead ends: 252 [2019-09-20 13:31:54,296 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-20 13:31:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2019-09-20 13:31:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-20 13:31:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2019-09-20 13:31:54,388 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2019-09-20 13:31:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:54,389 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2019-09-20 13:31:54,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2019-09-20 13:31:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:54,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:54,394 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:54,394 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:54,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1430979773, now seen corresponding path program 1 times [2019-09-20 13:31:54,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:54,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:54,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:54,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:54,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:54,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:54,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:54,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:54,565 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2019-09-20 13:31:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:55,397 INFO L93 Difference]: Finished difference Result 422 states and 573 transitions. [2019-09-20 13:31:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:31:55,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:31:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:55,402 INFO L225 Difference]: With dead ends: 422 [2019-09-20 13:31:55,402 INFO L226 Difference]: Without dead ends: 422 [2019-09-20 13:31:55,403 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:31:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-20 13:31:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2019-09-20 13:31:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:31:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2019-09-20 13:31:55,444 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2019-09-20 13:31:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:55,444 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2019-09-20 13:31:55,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2019-09-20 13:31:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:55,448 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:55,448 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:55,448 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1477202113, now seen corresponding path program 1 times [2019-09-20 13:31:55,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:55,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:55,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:55,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:55,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:55,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:55,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:55,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:55,523 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2019-09-20 13:31:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:55,554 INFO L93 Difference]: Finished difference Result 369 states and 486 transitions. [2019-09-20 13:31:55,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:55,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:31:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:55,557 INFO L225 Difference]: With dead ends: 369 [2019-09-20 13:31:55,558 INFO L226 Difference]: Without dead ends: 369 [2019-09-20 13:31:55,558 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-20 13:31:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2019-09-20 13:31:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:31:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2019-09-20 13:31:55,581 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2019-09-20 13:31:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:55,581 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2019-09-20 13:31:55,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2019-09-20 13:31:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:55,586 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:55,586 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:55,587 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:55,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1229055619, now seen corresponding path program 1 times [2019-09-20 13:31:55,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:55,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:55,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:31:55,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:55,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:31:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:31:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:55,693 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2019-09-20 13:31:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:55,874 INFO L93 Difference]: Finished difference Result 670 states and 861 transitions. [2019-09-20 13:31:55,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:31:55,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:31:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:55,880 INFO L225 Difference]: With dead ends: 670 [2019-09-20 13:31:55,881 INFO L226 Difference]: Without dead ends: 670 [2019-09-20 13:31:55,881 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-20 13:31:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-09-20 13:31:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-20 13:31:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2019-09-20 13:31:55,927 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2019-09-20 13:31:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:55,927 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2019-09-20 13:31:55,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:31:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2019-09-20 13:31:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:55,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:55,930 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:55,930 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:55,931 INFO L82 PathProgramCache]: Analyzing trace with hash 650743635, now seen corresponding path program 1 times [2019-09-20 13:31:55,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:55,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:55,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:55,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:55,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:55,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:55,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:55,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:55,995 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2019-09-20 13:31:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:56,026 INFO L93 Difference]: Finished difference Result 672 states and 852 transitions. [2019-09-20 13:31:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:56,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:31:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:56,031 INFO L225 Difference]: With dead ends: 672 [2019-09-20 13:31:56,031 INFO L226 Difference]: Without dead ends: 672 [2019-09-20 13:31:56,032 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-20 13:31:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2019-09-20 13:31:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-20 13:31:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2019-09-20 13:31:56,057 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2019-09-20 13:31:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:56,057 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2019-09-20 13:31:56,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2019-09-20 13:31:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:56,059 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:56,059 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:56,060 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash 578357077, now seen corresponding path program 1 times [2019-09-20 13:31:56,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:56,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:56,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:56,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:56,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:56,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:56,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:56,138 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2019-09-20 13:31:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:56,998 INFO L93 Difference]: Finished difference Result 831 states and 1047 transitions. [2019-09-20 13:31:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:31:56,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:31:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:57,003 INFO L225 Difference]: With dead ends: 831 [2019-09-20 13:31:57,003 INFO L226 Difference]: Without dead ends: 831 [2019-09-20 13:31:57,004 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:31:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-20 13:31:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2019-09-20 13:31:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-20 13:31:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2019-09-20 13:31:57,038 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2019-09-20 13:31:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:57,039 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2019-09-20 13:31:57,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2019-09-20 13:31:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:57,043 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:57,044 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:57,044 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash 68883987, now seen corresponding path program 1 times [2019-09-20 13:31:57,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:57,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:57,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:31:57,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:57,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:31:57,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:31:57,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:31:57,118 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2019-09-20 13:31:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:57,142 INFO L93 Difference]: Finished difference Result 1276 states and 1609 transitions. [2019-09-20 13:31:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:31:57,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-20 13:31:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:57,150 INFO L225 Difference]: With dead ends: 1276 [2019-09-20 13:31:57,150 INFO L226 Difference]: Without dead ends: 1276 [2019-09-20 13:31:57,151 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:31:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-09-20 13:31:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2019-09-20 13:31:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-20 13:31:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2019-09-20 13:31:57,197 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2019-09-20 13:31:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:57,198 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2019-09-20 13:31:57,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:31:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2019-09-20 13:31:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:31:57,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:57,201 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:57,201 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:57,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash 173246819, now seen corresponding path program 1 times [2019-09-20 13:31:57,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:57,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:57,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:57,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:57,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:57,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:57,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:57,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:57,304 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2019-09-20 13:31:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:57,390 INFO L93 Difference]: Finished difference Result 2309 states and 2955 transitions. [2019-09-20 13:31:57,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:31:57,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-20 13:31:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:57,405 INFO L225 Difference]: With dead ends: 2309 [2019-09-20 13:31:57,406 INFO L226 Difference]: Without dead ends: 2309 [2019-09-20 13:31:57,406 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:31:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-09-20 13:31:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2019-09-20 13:31:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2019-09-20 13:31:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2019-09-20 13:31:57,501 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2019-09-20 13:31:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:57,502 INFO L475 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2019-09-20 13:31:57,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2019-09-20 13:31:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:31:57,505 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:57,505 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:57,506 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1970791480, now seen corresponding path program 1 times [2019-09-20 13:31:57,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:57,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:57,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:57,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:57,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:57,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:57,590 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2019-09-20 13:31:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:58,197 INFO L93 Difference]: Finished difference Result 4830 states and 6579 transitions. [2019-09-20 13:31:58,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:58,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-20 13:31:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:58,236 INFO L225 Difference]: With dead ends: 4830 [2019-09-20 13:31:58,236 INFO L226 Difference]: Without dead ends: 4830 [2019-09-20 13:31:58,237 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2019-09-20 13:31:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2019-09-20 13:31:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2019-09-20 13:31:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2019-09-20 13:31:58,469 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2019-09-20 13:31:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:58,470 INFO L475 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2019-09-20 13:31:58,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2019-09-20 13:31:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:31:58,480 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:58,480 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:58,480 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1498291865, now seen corresponding path program 1 times [2019-09-20 13:31:58,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:58,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:58,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:31:58,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:58,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:31:58,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:58,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:31:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:31:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:58,525 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2019-09-20 13:31:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:58,626 INFO L93 Difference]: Finished difference Result 4574 states and 6130 transitions. [2019-09-20 13:31:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:31:58,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:31:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:58,653 INFO L225 Difference]: With dead ends: 4574 [2019-09-20 13:31:58,653 INFO L226 Difference]: Without dead ends: 4574 [2019-09-20 13:31:58,653 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-20 13:31:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2019-09-20 13:31:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2019-09-20 13:31:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6130 transitions. [2019-09-20 13:31:58,880 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6130 transitions. Word has length 88 [2019-09-20 13:31:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:58,880 INFO L475 AbstractCegarLoop]: Abstraction has 4574 states and 6130 transitions. [2019-09-20 13:31:58,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:31:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6130 transitions. [2019-09-20 13:31:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:31:58,882 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:58,882 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:58,882 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1829324777, now seen corresponding path program 1 times [2019-09-20 13:31:58,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:58,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:58,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:58,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:58,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:31:58,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:58,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:31:58,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:31:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:58,936 INFO L87 Difference]: Start difference. First operand 4574 states and 6130 transitions. Second operand 4 states. [2019-09-20 13:31:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:59,101 INFO L93 Difference]: Finished difference Result 6041 states and 8096 transitions. [2019-09-20 13:31:59,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:31:59,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:31:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:59,136 INFO L225 Difference]: With dead ends: 6041 [2019-09-20 13:31:59,137 INFO L226 Difference]: Without dead ends: 6041 [2019-09-20 13:31:59,137 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2019-09-20 13:31:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5872. [2019-09-20 13:31:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2019-09-20 13:31:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2019-09-20 13:31:59,363 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 88 [2019-09-20 13:31:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:59,364 INFO L475 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2019-09-20 13:31:59,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:31:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2019-09-20 13:31:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:31:59,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:59,366 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:59,366 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash -874813360, now seen corresponding path program 1 times [2019-09-20 13:31:59,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:59,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:59,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:59,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:31:59,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:31:59,530 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-20 13:31:59,533 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [153], [156], [166], [169], [192], [202], [204], [206], [207], [213], [215], [220], [226], [228], [229], [243], [245], [267], [277], [279], [281], [282], [283], [286], [302], [310], [312], [315], [320], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [377], [378], [379], [381] [2019-09-20 13:31:59,600 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:31:59,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:31:59,814 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:31:59,819 INFO L272 AbstractInterpreter]: Visited 86 different actions 89 times. Merged at 2 different actions 2 times. Never widened. Performed 392 root evaluator evaluations with a maximum evaluation depth of 4. Performed 392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2019-09-20 13:31:59,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:59,825 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:32:00,035 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 78.23% of their original sizes. [2019-09-20 13:32:00,036 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:32:00,690 INFO L420 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2019-09-20 13:32:00,691 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:32:00,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:00,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [6] total 37 [2019-09-20 13:32:00,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:00,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-20 13:32:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-20 13:32:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:32:00,694 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 33 states. [2019-09-20 13:32:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:15,445 INFO L93 Difference]: Finished difference Result 11617 states and 15651 transitions. [2019-09-20 13:32:15,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-20 13:32:15,446 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2019-09-20 13:32:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:15,556 INFO L225 Difference]: With dead ends: 11617 [2019-09-20 13:32:15,556 INFO L226 Difference]: Without dead ends: 11617 [2019-09-20 13:32:15,559 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=513, Invalid=2793, Unknown=0, NotChecked=0, Total=3306 [2019-09-20 13:32:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11617 states. [2019-09-20 13:32:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11617 to 10667. [2019-09-20 13:32:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2019-09-20 13:32:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 14383 transitions. [2019-09-20 13:32:16,185 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 14383 transitions. Word has length 89 [2019-09-20 13:32:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:16,186 INFO L475 AbstractCegarLoop]: Abstraction has 10667 states and 14383 transitions. [2019-09-20 13:32:16,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-20 13:32:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 14383 transitions. [2019-09-20 13:32:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:32:16,189 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:16,191 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:16,195 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash -851936585, now seen corresponding path program 1 times [2019-09-20 13:32:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:16,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:16,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:32:16,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:16,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:32:16,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:16,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:32:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:32:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:32:16,314 INFO L87 Difference]: Start difference. First operand 10667 states and 14383 transitions. Second operand 7 states. [2019-09-20 13:32:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:18,103 INFO L93 Difference]: Finished difference Result 23916 states and 32591 transitions. [2019-09-20 13:32:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:32:18,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-09-20 13:32:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:18,219 INFO L225 Difference]: With dead ends: 23916 [2019-09-20 13:32:18,219 INFO L226 Difference]: Without dead ends: 21075 [2019-09-20 13:32:18,220 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:32:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2019-09-20 13:32:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 19665. [2019-09-20 13:32:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19665 states. [2019-09-20 13:32:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 25847 transitions. [2019-09-20 13:32:19,492 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 25847 transitions. Word has length 100 [2019-09-20 13:32:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:19,492 INFO L475 AbstractCegarLoop]: Abstraction has 19665 states and 25847 transitions. [2019-09-20 13:32:19,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:32:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 25847 transitions. [2019-09-20 13:32:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:32:19,494 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:19,494 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:19,495 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1692518472, now seen corresponding path program 1 times [2019-09-20 13:32:19,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:19,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:19,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 13:32:19,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:19,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:19,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-20 13:32:19,567 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [81], [84], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [153], [156], [166], [169], [172], [192], [202], [204], [206], [207], [213], [215], [220], [226], [228], [229], [243], [245], [267], [277], [279], [281], [282], [283], [286], [302], [310], [312], [315], [320], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [377], [378], [379], [381] [2019-09-20 13:32:19,574 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:19,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:19,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:32:19,666 INFO L272 AbstractInterpreter]: Visited 91 different actions 154 times. Merged at 15 different actions 24 times. Never widened. Performed 854 root evaluator evaluations with a maximum evaluation depth of 4. Performed 854 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 40 variables. [2019-09-20 13:32:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:19,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:32:19,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:19,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:32:19,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:19,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:32:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:19,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:32:19,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:32:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:32:19,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:32:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 13:32:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:32:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2019-09-20 13:32:20,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:20,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:32:20,054 INFO L87 Difference]: Start difference. First operand 19665 states and 25847 transitions. Second operand 3 states. [2019-09-20 13:32:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:20,164 INFO L93 Difference]: Finished difference Result 11866 states and 14277 transitions. [2019-09-20 13:32:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:20,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-20 13:32:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:20,205 INFO L225 Difference]: With dead ends: 11866 [2019-09-20 13:32:20,205 INFO L226 Difference]: Without dead ends: 11725 [2019-09-20 13:32:20,206 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:32:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2019-09-20 13:32:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 9857. [2019-09-20 13:32:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9857 states. [2019-09-20 13:32:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9857 states to 9857 states and 11871 transitions. [2019-09-20 13:32:20,635 INFO L78 Accepts]: Start accepts. Automaton has 9857 states and 11871 transitions. Word has length 110 [2019-09-20 13:32:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:20,637 INFO L475 AbstractCegarLoop]: Abstraction has 9857 states and 11871 transitions. [2019-09-20 13:32:20,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 9857 states and 11871 transitions. [2019-09-20 13:32:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-20 13:32:20,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:20,644 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:20,645 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1329668345, now seen corresponding path program 1 times [2019-09-20 13:32:20,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:20,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:20,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-20 13:32:20,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:20,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:20,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2019-09-20 13:32:20,788 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [36], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [159], [166], [169], [180], [181], [183], [186], [190], [191], [192], [195], [198], [202], [204], [206], [207], [210], [213], [215], [218], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [270], [273], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [310], [312], [315], [318], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-20 13:32:20,800 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:20,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)