/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:53:06,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:53:06,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:53:06,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:53:06,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:53:06,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:53:06,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:53:06,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:53:06,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:53:06,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:53:06,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:53:06,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:53:06,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:53:06,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:53:06,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:53:06,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:53:06,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:53:06,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:53:06,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:53:06,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:53:06,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:53:06,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:53:06,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:53:06,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:53:06,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:53:06,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:53:06,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:53:06,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:53:06,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:53:06,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:53:06,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:53:06,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:53:06,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:53:06,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:53:06,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:53:06,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:53:06,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:53:06,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:53:06,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:53:06,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:53:06,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:53:06,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:53:06,857 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:53:06,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:53:06,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:53:06,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:53:06,860 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:53:06,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:53:06,861 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:53:06,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:53:06,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:53:06,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:53:06,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:53:06,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:53:06,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:53:06,862 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:53:06,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:53:06,862 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:53:06,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:53:06,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:53:06,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:53:06,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:53:06,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:53:06,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:53:06,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:53:06,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:53:06,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:53:06,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:53:06,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:53:06,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:53:06,865 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:53:06,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:53:07,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:53:07,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:53:07,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:53:07,268 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:53:07,269 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:53:07,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-11-06 22:53:07,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad69784d/984a5d1d93ab4a11aaa715f79c7d954a/FLAG220704532 [2020-11-06 22:53:08,023 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:53:08,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-11-06 22:53:08,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad69784d/984a5d1d93ab4a11aaa715f79c7d954a/FLAG220704532 [2020-11-06 22:53:08,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad69784d/984a5d1d93ab4a11aaa715f79c7d954a [2020-11-06 22:53:08,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:53:08,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:53:08,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:53:08,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:53:08,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:53:08,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff88526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08, skipping insertion in model container [2020-11-06 22:53:08,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:53:08,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:53:08,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:53:08,850 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:53:08,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:53:08,914 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:53:08,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08 WrapperNode [2020-11-06 22:53:08,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:53:08,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:53:08,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:53:08,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:53:08,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (1/1) ... [2020-11-06 22:53:08,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:53:08,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:53:08,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:53:08,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:53:08,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (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 [2020-11-06 22:53:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:53:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:53:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:53:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-06 22:53:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-06 22:53:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-06 22:53:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-06 22:53:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-06 22:53:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-06 22:53:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-06 22:53:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-06 22:53:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-06 22:53:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-06 22:53:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-06 22:53:09,076 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-06 22:53:09,076 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-06 22:53:09,076 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-06 22:53:09,076 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-06 22:53:09,076 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-06 22:53:09,076 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-06 22:53:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-06 22:53:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:53:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:53:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:53:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:53:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:53:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-06 22:53:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-06 22:53:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-06 22:53:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-06 22:53:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:53:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-06 22:53:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-06 22:53:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-06 22:53:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-06 22:53:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-06 22:53:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-06 22:53:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-06 22:53:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:53:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:53:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:53:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:53:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:53:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:53:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:53:09,788 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:53:09,788 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-06 22:53:09,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:09 BoogieIcfgContainer [2020-11-06 22:53:09,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:53:09,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:53:09,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:53:09,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:53:09,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:53:08" (1/3) ... [2020-11-06 22:53:09,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2401eb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:09, skipping insertion in model container [2020-11-06 22:53:09,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:08" (2/3) ... [2020-11-06 22:53:09,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2401eb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:09, skipping insertion in model container [2020-11-06 22:53:09,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:09" (3/3) ... [2020-11-06 22:53:09,801 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-11-06 22:53:09,818 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:53:09,823 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:53:09,835 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:53:09,862 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:53:09,862 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:53:09,862 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:53:09,862 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:53:09,862 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:53:09,863 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:53:09,863 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:53:09,863 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:53:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2020-11-06 22:53:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:09,898 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:09,899 INFO L422 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] [2020-11-06 22:53:09,900 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:09,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:09,907 INFO L82 PathProgramCache]: Analyzing trace with hash -309336953, now seen corresponding path program 1 times [2020-11-06 22:53:09,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:09,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330592688] [2020-11-06 22:53:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,444 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-06 22:53:10,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:10,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330592688] [2020-11-06 22:53:10,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:10,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:53:10,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175261087] [2020-11-06 22:53:10,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:53:10,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:53:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:53:10,743 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 8 states. [2020-11-06 22:53:10,924 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-06 22:53:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:13,511 INFO L93 Difference]: Finished difference Result 533 states and 809 transitions. [2020-11-06 22:53:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:53:13,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2020-11-06 22:53:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:13,532 INFO L225 Difference]: With dead ends: 533 [2020-11-06 22:53:13,532 INFO L226 Difference]: Without dead ends: 378 [2020-11-06 22:53:13,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:53:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-11-06 22:53:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 258. [2020-11-06 22:53:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-11-06 22:53:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 348 transitions. [2020-11-06 22:53:13,660 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 348 transitions. Word has length 79 [2020-11-06 22:53:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:13,660 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 348 transitions. [2020-11-06 22:53:13,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:53:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2020-11-06 22:53:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:13,665 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:13,665 INFO L422 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] [2020-11-06 22:53:13,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:53:13,666 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1510595527, now seen corresponding path program 1 times [2020-11-06 22:53:13,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:13,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720638526] [2020-11-06 22:53:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:13,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720638526] [2020-11-06 22:53:13,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:13,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:53:13,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386916130] [2020-11-06 22:53:13,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:53:13,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:53:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:53:13,954 INFO L87 Difference]: Start difference. First operand 258 states and 348 transitions. Second operand 9 states. [2020-11-06 22:53:14,391 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-11-06 22:53:16,153 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-11-06 22:53:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:18,650 INFO L93 Difference]: Finished difference Result 961 states and 1369 transitions. [2020-11-06 22:53:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-06 22:53:18,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2020-11-06 22:53:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:18,663 INFO L225 Difference]: With dead ends: 961 [2020-11-06 22:53:18,664 INFO L226 Difference]: Without dead ends: 722 [2020-11-06 22:53:18,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:53:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2020-11-06 22:53:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 489. [2020-11-06 22:53:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-11-06 22:53:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 666 transitions. [2020-11-06 22:53:18,818 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 666 transitions. Word has length 79 [2020-11-06 22:53:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:18,818 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 666 transitions. [2020-11-06 22:53:18,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:53:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 666 transitions. [2020-11-06 22:53:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:18,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:18,823 INFO L422 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] [2020-11-06 22:53:18,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:53:18,824 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1523454519, now seen corresponding path program 1 times [2020-11-06 22:53:18,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:18,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952168304] [2020-11-06 22:53:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:18,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:18,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:19,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952168304] [2020-11-06 22:53:19,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:19,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:19,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748660324] [2020-11-06 22:53:19,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:19,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:19,185 INFO L87 Difference]: Start difference. First operand 489 states and 666 transitions. Second operand 10 states. [2020-11-06 22:53:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:21,627 INFO L93 Difference]: Finished difference Result 1337 states and 1948 transitions. [2020-11-06 22:53:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:53:21,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-06 22:53:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:21,645 INFO L225 Difference]: With dead ends: 1337 [2020-11-06 22:53:21,645 INFO L226 Difference]: Without dead ends: 868 [2020-11-06 22:53:21,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:53:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2020-11-06 22:53:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 591. [2020-11-06 22:53:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-11-06 22:53:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 771 transitions. [2020-11-06 22:53:21,791 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 771 transitions. Word has length 79 [2020-11-06 22:53:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:21,794 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 771 transitions. [2020-11-06 22:53:21,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 771 transitions. [2020-11-06 22:53:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:21,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:21,797 INFO L422 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] [2020-11-06 22:53:21,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:53:21,798 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 440448265, now seen corresponding path program 1 times [2020-11-06 22:53:21,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:21,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023922602] [2020-11-06 22:53:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:21,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:21,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:21,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:21,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:21,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:22,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:22,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:22,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:22,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:22,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:22,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023922602] [2020-11-06 22:53:22,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:22,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:53:22,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567725615] [2020-11-06 22:53:22,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:53:22,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:22,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:53:22,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:53:22,066 INFO L87 Difference]: Start difference. First operand 591 states and 771 transitions. Second operand 9 states. [2020-11-06 22:53:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:26,259 INFO L93 Difference]: Finished difference Result 1905 states and 2577 transitions. [2020-11-06 22:53:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-06 22:53:26,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2020-11-06 22:53:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:26,273 INFO L225 Difference]: With dead ends: 1905 [2020-11-06 22:53:26,273 INFO L226 Difference]: Without dead ends: 1477 [2020-11-06 22:53:26,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:53:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-11-06 22:53:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1064. [2020-11-06 22:53:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-11-06 22:53:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1394 transitions. [2020-11-06 22:53:26,442 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1394 transitions. Word has length 79 [2020-11-06 22:53:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:26,443 INFO L481 AbstractCegarLoop]: Abstraction has 1064 states and 1394 transitions. [2020-11-06 22:53:26,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:53:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1394 transitions. [2020-11-06 22:53:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:26,445 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:26,445 INFO L422 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] [2020-11-06 22:53:26,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:53:26,446 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1827233675, now seen corresponding path program 1 times [2020-11-06 22:53:26,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:26,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335738539] [2020-11-06 22:53:26,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:26,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335738539] [2020-11-06 22:53:26,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:26,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:26,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553841550] [2020-11-06 22:53:26,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:26,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:26,709 INFO L87 Difference]: Start difference. First operand 1064 states and 1394 transitions. Second operand 10 states. [2020-11-06 22:53:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:28,971 INFO L93 Difference]: Finished difference Result 2396 states and 3219 transitions. [2020-11-06 22:53:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:53:28,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-06 22:53:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:28,984 INFO L225 Difference]: With dead ends: 2396 [2020-11-06 22:53:28,985 INFO L226 Difference]: Without dead ends: 1352 [2020-11-06 22:53:28,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:53:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-11-06 22:53:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1109. [2020-11-06 22:53:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-11-06 22:53:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1432 transitions. [2020-11-06 22:53:29,141 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1432 transitions. Word has length 79 [2020-11-06 22:53:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:29,143 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1432 transitions. [2020-11-06 22:53:29,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1432 transitions. [2020-11-06 22:53:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:29,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:29,146 INFO L422 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] [2020-11-06 22:53:29,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:53:29,147 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:29,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2075380169, now seen corresponding path program 1 times [2020-11-06 22:53:29,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:29,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849822807] [2020-11-06 22:53:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:29,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849822807] [2020-11-06 22:53:29,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:29,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:29,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81804134] [2020-11-06 22:53:29,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:29,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:29,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:29,433 INFO L87 Difference]: Start difference. First operand 1109 states and 1432 transitions. Second operand 10 states. [2020-11-06 22:53:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:31,527 INFO L93 Difference]: Finished difference Result 2521 states and 3341 transitions. [2020-11-06 22:53:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:53:31,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-06 22:53:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:31,538 INFO L225 Difference]: With dead ends: 2521 [2020-11-06 22:53:31,539 INFO L226 Difference]: Without dead ends: 1432 [2020-11-06 22:53:31,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:53:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-11-06 22:53:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1179. [2020-11-06 22:53:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2020-11-06 22:53:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1500 transitions. [2020-11-06 22:53:31,687 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1500 transitions. Word has length 79 [2020-11-06 22:53:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:31,687 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1500 transitions. [2020-11-06 22:53:31,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1500 transitions. [2020-11-06 22:53:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:31,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:31,691 INFO L422 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] [2020-11-06 22:53:31,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:53:31,691 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2002993611, now seen corresponding path program 1 times [2020-11-06 22:53:31,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:31,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067524] [2020-11-06 22:53:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:31,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:32,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067524] [2020-11-06 22:53:32,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:32,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:32,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582552802] [2020-11-06 22:53:32,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:32,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:32,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:32,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:32,006 INFO L87 Difference]: Start difference. First operand 1179 states and 1500 transitions. Second operand 10 states. [2020-11-06 22:53:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:35,035 INFO L93 Difference]: Finished difference Result 2551 states and 3333 transitions. [2020-11-06 22:53:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-06 22:53:35,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-06 22:53:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:35,051 INFO L225 Difference]: With dead ends: 2551 [2020-11-06 22:53:35,051 INFO L226 Difference]: Without dead ends: 1393 [2020-11-06 22:53:35,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:53:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-11-06 22:53:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1027. [2020-11-06 22:53:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027 states. [2020-11-06 22:53:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1270 transitions. [2020-11-06 22:53:35,175 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1270 transitions. Word has length 79 [2020-11-06 22:53:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:35,176 INFO L481 AbstractCegarLoop]: Abstraction has 1027 states and 1270 transitions. [2020-11-06 22:53:35,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1270 transitions. [2020-11-06 22:53:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-06 22:53:35,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:35,177 INFO L422 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] [2020-11-06 22:53:35,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:53:35,178 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2065033225, now seen corresponding path program 1 times [2020-11-06 22:53:35,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:35,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746603419] [2020-11-06 22:53:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:53:35,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746603419] [2020-11-06 22:53:35,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:35,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:53:35,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275089965] [2020-11-06 22:53:35,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:53:35,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:53:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:53:35,375 INFO L87 Difference]: Start difference. First operand 1027 states and 1270 transitions. Second operand 7 states. [2020-11-06 22:53:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:37,526 INFO L93 Difference]: Finished difference Result 2923 states and 3855 transitions. [2020-11-06 22:53:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:53:37,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-11-06 22:53:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:37,539 INFO L225 Difference]: With dead ends: 2923 [2020-11-06 22:53:37,539 INFO L226 Difference]: Without dead ends: 1928 [2020-11-06 22:53:37,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:53:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2020-11-06 22:53:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1600. [2020-11-06 22:53:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2020-11-06 22:53:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2029 transitions. [2020-11-06 22:53:37,727 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2029 transitions. Word has length 79 [2020-11-06 22:53:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:37,728 INFO L481 AbstractCegarLoop]: Abstraction has 1600 states and 2029 transitions. [2020-11-06 22:53:37,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:53:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2029 transitions. [2020-11-06 22:53:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-06 22:53:37,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:37,732 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-06 22:53:37,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:53:37,732 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1649947512, now seen corresponding path program 1 times [2020-11-06 22:53:37,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:37,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677225192] [2020-11-06 22:53:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:53:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:37,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:53:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:38,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:38,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:38,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:38,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-06 22:53:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-06 22:53:38,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677225192] [2020-11-06 22:53:38,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:38,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:38,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315389607] [2020-11-06 22:53:38,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:38,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:38,047 INFO L87 Difference]: Start difference. First operand 1600 states and 2029 transitions. Second operand 10 states. [2020-11-06 22:53:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:41,552 INFO L93 Difference]: Finished difference Result 5046 states and 7077 transitions. [2020-11-06 22:53:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:53:41,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2020-11-06 22:53:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:41,583 INFO L225 Difference]: With dead ends: 5046 [2020-11-06 22:53:41,583 INFO L226 Difference]: Without dead ends: 3502 [2020-11-06 22:53:41,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:53:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2020-11-06 22:53:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2846. [2020-11-06 22:53:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2020-11-06 22:53:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3790 transitions. [2020-11-06 22:53:41,990 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3790 transitions. Word has length 124 [2020-11-06 22:53:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:41,990 INFO L481 AbstractCegarLoop]: Abstraction has 2846 states and 3790 transitions. [2020-11-06 22:53:41,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3790 transitions. [2020-11-06 22:53:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-06 22:53:41,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:41,997 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:53:41,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:53:41,997 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:41,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1451470011, now seen corresponding path program 1 times [2020-11-06 22:53:41,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:41,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282802884] [2020-11-06 22:53:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:53:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-06 22:53:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-06 22:53:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:53:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-06 22:53:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-11-06 22:53:42,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282802884] [2020-11-06 22:53:42,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:42,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:42,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366522953] [2020-11-06 22:53:42,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:42,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:42,287 INFO L87 Difference]: Start difference. First operand 2846 states and 3790 transitions. Second operand 10 states. [2020-11-06 22:53:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:44,335 INFO L93 Difference]: Finished difference Result 6064 states and 8149 transitions. [2020-11-06 22:53:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:53:44,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2020-11-06 22:53:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:44,361 INFO L225 Difference]: With dead ends: 6064 [2020-11-06 22:53:44,362 INFO L226 Difference]: Without dead ends: 3273 [2020-11-06 22:53:44,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:53:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2020-11-06 22:53:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2806. [2020-11-06 22:53:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2020-11-06 22:53:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3742 transitions. [2020-11-06 22:53:44,730 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3742 transitions. Word has length 142 [2020-11-06 22:53:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:44,731 INFO L481 AbstractCegarLoop]: Abstraction has 2806 states and 3742 transitions. [2020-11-06 22:53:44,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3742 transitions. [2020-11-06 22:53:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-11-06 22:53:44,735 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:44,735 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-06 22:53:44,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:53:44,736 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash -425217590, now seen corresponding path program 1 times [2020-11-06 22:53:44,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:44,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024328474] [2020-11-06 22:53:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:53:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:53:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:44,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:53:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-06 22:53:45,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024328474] [2020-11-06 22:53:45,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:45,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:53:45,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167498832] [2020-11-06 22:53:45,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:53:45,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:45,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:53:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:53:45,018 INFO L87 Difference]: Start difference. First operand 2806 states and 3742 transitions. Second operand 11 states. [2020-11-06 22:53:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:51,296 INFO L93 Difference]: Finished difference Result 9074 states and 12619 transitions. [2020-11-06 22:53:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-06 22:53:51,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2020-11-06 22:53:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:51,329 INFO L225 Difference]: With dead ends: 9074 [2020-11-06 22:53:51,330 INFO L226 Difference]: Without dead ends: 4623 [2020-11-06 22:53:51,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=333, Invalid=1307, Unknown=0, NotChecked=0, Total=1640 [2020-11-06 22:53:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2020-11-06 22:53:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4039. [2020-11-06 22:53:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4039 states. [2020-11-06 22:53:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 5184 transitions. [2020-11-06 22:53:51,860 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 5184 transitions. Word has length 125 [2020-11-06 22:53:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:51,861 INFO L481 AbstractCegarLoop]: Abstraction has 4039 states and 5184 transitions. [2020-11-06 22:53:51,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:53:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 5184 transitions. [2020-11-06 22:53:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-06 22:53:51,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:51,867 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-06 22:53:51,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:53:51,867 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1851403327, now seen corresponding path program 1 times [2020-11-06 22:53:51,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:51,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827110630] [2020-11-06 22:53:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:51,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:53:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:53:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-06 22:53:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:53:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-06 22:53:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-06 22:53:52,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827110630] [2020-11-06 22:53:52,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:53:52,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:53:52,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693666386] [2020-11-06 22:53:52,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:53:52,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:53:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:53:52,302 INFO L87 Difference]: Start difference. First operand 4039 states and 5184 transitions. Second operand 10 states. [2020-11-06 22:53:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:55,385 INFO L93 Difference]: Finished difference Result 9305 states and 12571 transitions. [2020-11-06 22:53:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-06 22:53:55,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2020-11-06 22:53:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:55,421 INFO L225 Difference]: With dead ends: 9305 [2020-11-06 22:53:55,421 INFO L226 Difference]: Without dead ends: 5313 [2020-11-06 22:53:55,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:53:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2020-11-06 22:53:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 4830. [2020-11-06 22:53:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2020-11-06 22:53:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 6060 transitions. [2020-11-06 22:53:56,037 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 6060 transitions. Word has length 159 [2020-11-06 22:53:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:56,038 INFO L481 AbstractCegarLoop]: Abstraction has 4830 states and 6060 transitions. [2020-11-06 22:53:56,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:53:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 6060 transitions. [2020-11-06 22:53:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-06 22:53:56,046 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:56,046 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:53:56,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:53:56,047 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:56,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1869117932, now seen corresponding path program 1 times [2020-11-06 22:53:56,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:56,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124097319] [2020-11-06 22:53:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:53:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:53:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-06 22:53:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-06 22:53:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-11-06 22:53:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:53:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-11-06 22:53:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-06 22:53:56,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124097319] [2020-11-06 22:53:56,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298876199] [2020-11-06 22:53:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:53:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:56,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:53:56,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:53:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-06 22:53:56,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:53:56,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2020-11-06 22:53:56,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669577371] [2020-11-06 22:53:56,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:53:56,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:53:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:53:56,800 INFO L87 Difference]: Start difference. First operand 4830 states and 6060 transitions. Second operand 3 states. [2020-11-06 22:53:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:57,560 INFO L93 Difference]: Finished difference Result 8564 states and 11269 transitions. [2020-11-06 22:53:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:53:57,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-06 22:53:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:57,589 INFO L225 Difference]: With dead ends: 8564 [2020-11-06 22:53:57,589 INFO L226 Difference]: Without dead ends: 4654 [2020-11-06 22:53:57,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:53:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2020-11-06 22:53:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4648. [2020-11-06 22:53:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4648 states. [2020-11-06 22:53:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 5715 transitions. [2020-11-06 22:53:58,283 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 5715 transitions. Word has length 178 [2020-11-06 22:53:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:58,284 INFO L481 AbstractCegarLoop]: Abstraction has 4648 states and 5715 transitions. [2020-11-06 22:53:58,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:53:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 5715 transitions. [2020-11-06 22:53:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-06 22:53:58,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:58,292 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-06 22:53:58,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-06 22:53:58,507 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1883740737, now seen corresponding path program 1 times [2020-11-06 22:53:58,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:58,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986232086] [2020-11-06 22:53:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:53:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:53:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:53:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:53:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:53:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:53:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:53:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:53:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:53:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:53:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-06 22:53:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-06 22:53:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-11-06 22:53:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:53:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:53:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:53:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:53:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-06 22:53:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-11-06 22:53:58,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986232086] [2020-11-06 22:53:58,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003340632] [2020-11-06 22:53:58,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:53:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:53:59,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:53:59,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:53:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-06 22:53:59,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:53:59,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 12 [2020-11-06 22:53:59,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117731696] [2020-11-06 22:53:59,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:53:59,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:53:59,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:53:59,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:53:59,153 INFO L87 Difference]: Start difference. First operand 4648 states and 5715 transitions. Second operand 3 states. [2020-11-06 22:53:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:53:59,458 INFO L93 Difference]: Finished difference Result 6539 states and 8106 transitions. [2020-11-06 22:53:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:53:59,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-11-06 22:53:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:53:59,468 INFO L225 Difference]: With dead ends: 6539 [2020-11-06 22:53:59,468 INFO L226 Difference]: Without dead ends: 1872 [2020-11-06 22:53:59,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:53:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2020-11-06 22:53:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1862. [2020-11-06 22:53:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2020-11-06 22:53:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2143 transitions. [2020-11-06 22:53:59,760 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2143 transitions. Word has length 179 [2020-11-06 22:53:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:53:59,761 INFO L481 AbstractCegarLoop]: Abstraction has 1862 states and 2143 transitions. [2020-11-06 22:53:59,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:53:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2143 transitions. [2020-11-06 22:53:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-06 22:53:59,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:53:59,765 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-06 22:53:59,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-06 22:53:59,980 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:53:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:53:59,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2051497620, now seen corresponding path program 1 times [2020-11-06 22:53:59,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:53:59,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240501413] [2020-11-06 22:53:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:54:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:54:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:54:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:54:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-06 22:54:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:54:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:54:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-11-06 22:54:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:54:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-06 22:54:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-11-06 22:54:00,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240501413] [2020-11-06 22:54:00,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226885441] [2020-11-06 22:54:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:54:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:00,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-06 22:54:00,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:54:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-06 22:54:00,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:54:00,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-11-06 22:54:00,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681955326] [2020-11-06 22:54:00,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:54:00,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:54:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:54:00,732 INFO L87 Difference]: Start difference. First operand 1862 states and 2143 transitions. Second operand 12 states. [2020-11-06 22:54:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:04,016 INFO L93 Difference]: Finished difference Result 2174 states and 2502 transitions. [2020-11-06 22:54:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-06 22:54:04,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2020-11-06 22:54:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:04,046 INFO L225 Difference]: With dead ends: 2174 [2020-11-06 22:54:04,046 INFO L226 Difference]: Without dead ends: 2170 [2020-11-06 22:54:04,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-11-06 22:54:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2020-11-06 22:54:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1877. [2020-11-06 22:54:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2020-11-06 22:54:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2161 transitions. [2020-11-06 22:54:04,347 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2161 transitions. Word has length 179 [2020-11-06 22:54:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:04,351 INFO L481 AbstractCegarLoop]: Abstraction has 1877 states and 2161 transitions. [2020-11-06 22:54:04,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:54:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2161 transitions. [2020-11-06 22:54:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-11-06 22:54:04,355 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:04,356 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-06 22:54:04,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-06 22:54:04,571 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 54468076, now seen corresponding path program 1 times [2020-11-06 22:54:04,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:04,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262864717] [2020-11-06 22:54:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:54:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:54:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:54:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:54:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:54:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-06 22:54:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-06 22:54:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:54:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-06 22:54:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:54:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:54:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-11-06 22:54:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:54:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:54:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:54:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:54:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-06 22:54:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-06 22:54:04,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262864717] [2020-11-06 22:54:04,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480538104] [2020-11-06 22:54:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:54:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:54:05,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:54:05,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:54:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-11-06 22:54:05,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:54:05,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-11-06 22:54:05,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151739441] [2020-11-06 22:54:05,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:54:05,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:54:05,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:54:05,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:54:05,192 INFO L87 Difference]: Start difference. First operand 1877 states and 2161 transitions. Second operand 3 states. [2020-11-06 22:54:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:54:05,520 INFO L93 Difference]: Finished difference Result 3190 states and 3716 transitions. [2020-11-06 22:54:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:54:05,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2020-11-06 22:54:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:54:05,530 INFO L225 Difference]: With dead ends: 3190 [2020-11-06 22:54:05,530 INFO L226 Difference]: Without dead ends: 1905 [2020-11-06 22:54:05,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:54:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2020-11-06 22:54:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1905. [2020-11-06 22:54:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2020-11-06 22:54:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2197 transitions. [2020-11-06 22:54:05,863 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2197 transitions. Word has length 183 [2020-11-06 22:54:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:54:05,864 INFO L481 AbstractCegarLoop]: Abstraction has 1905 states and 2197 transitions. [2020-11-06 22:54:05,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:54:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2197 transitions. [2020-11-06 22:54:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-06 22:54:05,869 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:54:05,870 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-06 22:54:06,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:54:06,083 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:54:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:54:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1140527567, now seen corresponding path program 1 times [2020-11-06 22:54:06,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:54:06,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597639579] [2020-11-06 22:54:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:54:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:54:06,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:54:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:54:06,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:54:06,296 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:54:06,296 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:54:06,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:54:06,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:54:06 BoogieIcfgContainer [2020-11-06 22:54:06,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:54:06,538 INFO L168 Benchmark]: Toolchain (without parser) took 58167.58 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 871.4 MB). Free memory was 125.9 MB in the beginning and 652.7 MB in the end (delta: -526.8 MB). Peak memory consumption was 345.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:06,541 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:54:06,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.23 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 112.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:06,546 INFO L168 Benchmark]: Boogie Preprocessor took 66.16 ms. Allocated memory is still 151.0 MB. Free memory was 112.3 MB in the beginning and 110.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:06,549 INFO L168 Benchmark]: RCFGBuilder took 804.89 ms. Allocated memory is still 151.0 MB. Free memory was 110.4 MB in the beginning and 110.4 MB in the end (delta: -25.4 kB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:06,551 INFO L168 Benchmark]: TraceAbstraction took 56742.15 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 871.4 MB). Free memory was 109.9 MB in the beginning and 652.7 MB in the end (delta: -542.9 MB). Peak memory consumption was 328.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:54:06,556 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 533.23 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 112.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.16 ms. Allocated memory is still 151.0 MB. Free memory was 112.3 MB in the beginning and 110.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 804.89 ms. Allocated memory is still 151.0 MB. Free memory was 110.4 MB in the beginning and 110.4 MB in the end (delta: -25.4 kB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 56742.15 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 871.4 MB). Free memory was 109.9 MB in the beginning and 652.7 MB in the end (delta: -542.9 MB). Peak memory consumption was 328.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L481] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L392] m_i = 1 [L393] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L481] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L482] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L428] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=0] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-2, token=0] [L47] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-2, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-2, token=0] [L53] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L53] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=-2, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=-2, token=0] [L230] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 [L112] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=1, token=1] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L39] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L61] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L66] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L67] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] CALL reach_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L3] __assert_fail("0", "token_ring.01.cil-2.c", 3, "reach_error") VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 155 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 56.4s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2988 SDtfs, 10006 SDslu, 956 SDs, 0 SdLazy, 17083 SolverSat, 5745 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1576 GetRequests, 1275 SyntacticMatches, 6 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4830occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 4732 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2804 NumberOfCodeBlocks, 2804 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2600 ConstructedInterpolants, 0 QuantifiedInterpolants, 874314 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3144 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 1017/1052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...