/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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.1.25-79ed534 [2020-07-20 04:13:50,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 04:13:50,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 04:13:50,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 04:13:50,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 04:13:50,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 04:13:50,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 04:13:50,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 04:13:50,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 04:13:50,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 04:13:50,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 04:13:50,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 04:13:50,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 04:13:50,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 04:13:50,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 04:13:50,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 04:13:50,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 04:13:50,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 04:13:50,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 04:13:50,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 04:13:50,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 04:13:50,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 04:13:50,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 04:13:50,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 04:13:50,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 04:13:50,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 04:13:50,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 04:13:50,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 04:13:50,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 04:13:50,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 04:13:50,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 04:13:50,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 04:13:50,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 04:13:50,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 04:13:50,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 04:13:50,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 04:13:50,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 04:13:50,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 04:13:50,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 04:13:50,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 04:13:50,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 04:13:50,878 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-07-20 04:13:50,902 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 04:13:50,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 04:13:50,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 04:13:50,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 04:13:50,908 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 04:13:50,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 04:13:50,909 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 04:13:50,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 04:13:50,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 04:13:50,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 04:13:50,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 04:13:50,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 04:13:50,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 04:13:50,910 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 04:13:50,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 04:13:50,911 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 04:13:50,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 04:13:50,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 04:13:50,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 04:13:50,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 04:13:50,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 04:13:50,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 04:13:50,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 04:13:50,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 04:13:50,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 04:13:50,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 04:13:50,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 04:13:50,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 04:13:50,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 04:13:50,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 04:13:51,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 04:13:51,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 04:13:51,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 04:13:51,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 04:13:51,346 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 04:13:51,347 INFO L429 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-07-20 04:13:51,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40fd3dd35/e6bf49c1d7034a9f8328965811c2bef7/FLAG9a154c869 [2020-07-20 04:13:52,113 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 04:13:52,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-07-20 04:13:52,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40fd3dd35/e6bf49c1d7034a9f8328965811c2bef7/FLAG9a154c869 [2020-07-20 04:13:52,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40fd3dd35/e6bf49c1d7034a9f8328965811c2bef7 [2020-07-20 04:13:52,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 04:13:52,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 04:13:52,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 04:13:52,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 04:13:52,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 04:13:52,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:13:52" (1/1) ... [2020-07-20 04:13:52,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8af916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:52, skipping insertion in model container [2020-07-20 04:13:52,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:13:52" (1/1) ... [2020-07-20 04:13:52,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 04:13:52,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 04:13:52,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 04:13:52,801 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 04:13:52,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 04:13:53,033 INFO L208 MainTranslator]: Completed translation [2020-07-20 04:13:53,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53 WrapperNode [2020-07-20 04:13:53,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 04:13:53,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 04:13:53,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 04:13:53,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 04:13:53,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (1/1) ... [2020-07-20 04:13:53,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (1/1) ... [2020-07-20 04:13:53,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (1/1) ... [2020-07-20 04:13:53,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (1/1) ... [2020-07-20 04:13:53,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (1/1) ... [2020-07-20 04:13:53,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (1/1) ... [2020-07-20 04:13:53,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (1/1) ... [2020-07-20 04:13:53,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 04:13:53,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 04:13:53,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 04:13:53,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 04:13:53,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (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-07-20 04:13:53,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 04:13:53,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 04:13:53,192 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 04:13:53,192 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 04:13:53,192 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 04:13:53,192 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 04:13:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 04:13:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 04:13:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 04:13:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 04:13:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 04:13:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 04:13:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 04:13:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 04:13:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 04:13:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 04:13:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 04:13:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 04:13:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 04:13:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 04:13:53,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 04:13:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 04:13:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 04:13:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 04:13:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 04:13:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 04:13:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 04:13:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 04:13:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 04:13:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 04:13:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 04:13:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 04:13:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 04:13:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 04:13:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 04:13:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 04:13:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 04:13:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 04:13:53,199 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 04:13:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 04:13:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 04:13:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 04:13:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 04:13:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 04:13:53,937 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 04:13:53,937 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 04:13:53,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:13:53 BoogieIcfgContainer [2020-07-20 04:13:53,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 04:13:53,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 04:13:53,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 04:13:53,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 04:13:53,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:13:52" (1/3) ... [2020-07-20 04:13:53,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8906a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:13:53, skipping insertion in model container [2020-07-20 04:13:53,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:13:53" (2/3) ... [2020-07-20 04:13:53,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8906a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:13:53, skipping insertion in model container [2020-07-20 04:13:53,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:13:53" (3/3) ... [2020-07-20 04:13:53,959 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-07-20 04:13:53,974 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 04:13:53,985 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 04:13:54,002 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 04:13:54,041 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 04:13:54,041 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 04:13:54,041 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 04:13:54,041 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 04:13:54,041 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 04:13:54,042 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 04:13:54,042 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 04:13:54,042 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 04:13:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-07-20 04:13:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 04:13:54,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:54,095 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] [2020-07-20 04:13:54,095 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2020-07-20 04:13:54,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:54,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763960740] [2020-07-20 04:13:54,121 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:13:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:13:54,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763960740] [2020-07-20 04:13:54,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:54,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 04:13:54,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397678799] [2020-07-20 04:13:54,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 04:13:54,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 04:13:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:13:54,904 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 9 states. [2020-07-20 04:13:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:57,813 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2020-07-20 04:13:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 04:13:57,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-07-20 04:13:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:13:57,846 INFO L225 Difference]: With dead ends: 522 [2020-07-20 04:13:57,846 INFO L226 Difference]: Without dead ends: 371 [2020-07-20 04:13:57,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-20 04:13:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-07-20 04:13:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 257. [2020-07-20 04:13:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-20 04:13:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2020-07-20 04:13:58,016 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 346 transitions. Word has length 78 [2020-07-20 04:13:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:13:58,020 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 346 transitions. [2020-07-20 04:13:58,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 04:13:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2020-07-20 04:13:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 04:13:58,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:13:58,032 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] [2020-07-20 04:13:58,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 04:13:58,034 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:13:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:13:58,035 INFO L82 PathProgramCache]: Analyzing trace with hash 211359051, now seen corresponding path program 1 times [2020-07-20 04:13:58,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:13:58,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263087928] [2020-07-20 04:13:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:13:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:13:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:13:58,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263087928] [2020-07-20 04:13:58,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:13:58,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:13:58,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100401193] [2020-07-20 04:13:58,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:13:58,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:13:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:13:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:13:58,333 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. Second operand 10 states. [2020-07-20 04:13:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:13:59,992 INFO L93 Difference]: Finished difference Result 599 states and 848 transitions. [2020-07-20 04:13:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 04:13:59,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 04:13:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:00,013 INFO L225 Difference]: With dead ends: 599 [2020-07-20 04:14:00,014 INFO L226 Difference]: Without dead ends: 361 [2020-07-20 04:14:00,028 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-20 04:14:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-07-20 04:14:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2020-07-20 04:14:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-20 04:14:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2020-07-20 04:14:00,105 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 78 [2020-07-20 04:14:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:00,105 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2020-07-20 04:14:00,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:14:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2020-07-20 04:14:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 04:14:00,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:00,107 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] [2020-07-20 04:14:00,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 04:14:00,108 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2119705461, now seen corresponding path program 1 times [2020-07-20 04:14:00,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:00,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403419329] [2020-07-20 04:14:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:14:00,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403419329] [2020-07-20 04:14:00,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:14:00,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:14:00,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631137087] [2020-07-20 04:14:00,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:14:00,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:00,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:14:00,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:00,382 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand 10 states. [2020-07-20 04:14:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:02,190 INFO L93 Difference]: Finished difference Result 722 states and 1058 transitions. [2020-07-20 04:14:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 04:14:02,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 04:14:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:02,197 INFO L225 Difference]: With dead ends: 722 [2020-07-20 04:14:02,198 INFO L226 Difference]: Without dead ends: 484 [2020-07-20 04:14:02,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-20 04:14:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-07-20 04:14:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2020-07-20 04:14:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-07-20 04:14:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 392 transitions. [2020-07-20 04:14:02,262 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 392 transitions. Word has length 78 [2020-07-20 04:14:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:02,262 INFO L479 AbstractCegarLoop]: Abstraction has 309 states and 392 transitions. [2020-07-20 04:14:02,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:14:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 392 transitions. [2020-07-20 04:14:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 04:14:02,266 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:02,266 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] [2020-07-20 04:14:02,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 04:14:02,266 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash -579817174, now seen corresponding path program 1 times [2020-07-20 04:14:02,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:02,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218073186] [2020-07-20 04:14:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:14:02,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218073186] [2020-07-20 04:14:02,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:14:02,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:14:02,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448929066] [2020-07-20 04:14:02,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:14:02,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:02,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:14:02,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:02,589 INFO L87 Difference]: Start difference. First operand 309 states and 392 transitions. Second operand 10 states. [2020-07-20 04:14:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:04,414 INFO L93 Difference]: Finished difference Result 744 states and 1001 transitions. [2020-07-20 04:14:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 04:14:04,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 04:14:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:04,420 INFO L225 Difference]: With dead ends: 744 [2020-07-20 04:14:04,421 INFO L226 Difference]: Without dead ends: 455 [2020-07-20 04:14:04,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-20 04:14:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-07-20 04:14:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 329. [2020-07-20 04:14:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-07-20 04:14:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 412 transitions. [2020-07-20 04:14:04,508 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 412 transitions. Word has length 78 [2020-07-20 04:14:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:04,509 INFO L479 AbstractCegarLoop]: Abstraction has 329 states and 412 transitions. [2020-07-20 04:14:04,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:14:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 412 transitions. [2020-07-20 04:14:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 04:14:04,522 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:04,524 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] [2020-07-20 04:14:04,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 04:14:04,532 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:04,533 INFO L82 PathProgramCache]: Analyzing trace with hash -156170452, now seen corresponding path program 1 times [2020-07-20 04:14:04,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:04,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282825611] [2020-07-20 04:14:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:14:04,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282825611] [2020-07-20 04:14:04,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:14:04,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:14:04,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368014063] [2020-07-20 04:14:04,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:14:04,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:14:04,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:04,825 INFO L87 Difference]: Start difference. First operand 329 states and 412 transitions. Second operand 10 states. [2020-07-20 04:14:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:06,595 INFO L93 Difference]: Finished difference Result 774 states and 1027 transitions. [2020-07-20 04:14:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 04:14:06,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 04:14:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:06,600 INFO L225 Difference]: With dead ends: 774 [2020-07-20 04:14:06,601 INFO L226 Difference]: Without dead ends: 465 [2020-07-20 04:14:06,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-20 04:14:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-07-20 04:14:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 339. [2020-07-20 04:14:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-07-20 04:14:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2020-07-20 04:14:06,648 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 78 [2020-07-20 04:14:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:06,649 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2020-07-20 04:14:06,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:14:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2020-07-20 04:14:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 04:14:06,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:06,651 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] [2020-07-20 04:14:06,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 04:14:06,652 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:06,653 INFO L82 PathProgramCache]: Analyzing trace with hash 118589162, now seen corresponding path program 1 times [2020-07-20 04:14:06,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:06,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066776826] [2020-07-20 04:14:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:14:06,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066776826] [2020-07-20 04:14:06,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:14:06,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 04:14:06,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163006644] [2020-07-20 04:14:06,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 04:14:06,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 04:14:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:06,875 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand 10 states. [2020-07-20 04:14:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:08,721 INFO L93 Difference]: Finished difference Result 920 states and 1216 transitions. [2020-07-20 04:14:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 04:14:08,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 04:14:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:08,730 INFO L225 Difference]: With dead ends: 920 [2020-07-20 04:14:08,731 INFO L226 Difference]: Without dead ends: 600 [2020-07-20 04:14:08,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-20 04:14:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-07-20 04:14:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 375. [2020-07-20 04:14:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-20 04:14:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 445 transitions. [2020-07-20 04:14:08,798 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 445 transitions. Word has length 78 [2020-07-20 04:14:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:08,799 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 445 transitions. [2020-07-20 04:14:08,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 04:14:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 445 transitions. [2020-07-20 04:14:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 04:14:08,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:08,803 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] [2020-07-20 04:14:08,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 04:14:08,804 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2020-07-20 04:14:08,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:08,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542054833] [2020-07-20 04:14:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:14:09,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542054833] [2020-07-20 04:14:09,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:14:09,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 04:14:09,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329785127] [2020-07-20 04:14:09,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 04:14:09,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 04:14:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 04:14:09,078 INFO L87 Difference]: Start difference. First operand 375 states and 445 transitions. Second operand 7 states. [2020-07-20 04:14:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:10,720 INFO L93 Difference]: Finished difference Result 1208 states and 1535 transitions. [2020-07-20 04:14:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 04:14:10,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2020-07-20 04:14:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:10,739 INFO L225 Difference]: With dead ends: 1208 [2020-07-20 04:14:10,740 INFO L226 Difference]: Without dead ends: 853 [2020-07-20 04:14:10,745 INFO L675 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-07-20 04:14:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2020-07-20 04:14:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 751. [2020-07-20 04:14:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-07-20 04:14:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 921 transitions. [2020-07-20 04:14:10,965 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 921 transitions. Word has length 78 [2020-07-20 04:14:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:10,966 INFO L479 AbstractCegarLoop]: Abstraction has 751 states and 921 transitions. [2020-07-20 04:14:10,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 04:14:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 921 transitions. [2020-07-20 04:14:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-20 04:14:10,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:10,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-20 04:14:10,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 04:14:10,973 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash 972462964, now seen corresponding path program 1 times [2020-07-20 04:14:10,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:10,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323250420] [2020-07-20 04:14:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 04:14:11,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323250420] [2020-07-20 04:14:11,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342934981] [2020-07-20 04:14:11,369 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6f0ecc48 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-07-20 04:14:11,496 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6f0ecc48 issued 1 check-sat command(s) [2020-07-20 04:14:11,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:14:11,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 04:14:11,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:14:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 04:14:11,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:14:11,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-20 04:14:11,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079598720] [2020-07-20 04:14:11,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:14:11,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:11,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:14:11,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:11,676 INFO L87 Difference]: Start difference. First operand 751 states and 921 transitions. Second operand 3 states. [2020-07-20 04:14:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:11,929 INFO L93 Difference]: Finished difference Result 2037 states and 2550 transitions. [2020-07-20 04:14:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:14:11,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-07-20 04:14:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:11,942 INFO L225 Difference]: With dead ends: 2037 [2020-07-20 04:14:11,942 INFO L226 Difference]: Without dead ends: 1033 [2020-07-20 04:14:11,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2020-07-20 04:14:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2020-07-20 04:14:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-07-20 04:14:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1261 transitions. [2020-07-20 04:14:12,099 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1261 transitions. Word has length 123 [2020-07-20 04:14:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:12,100 INFO L479 AbstractCegarLoop]: Abstraction has 1033 states and 1261 transitions. [2020-07-20 04:14:12,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:14:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1261 transitions. [2020-07-20 04:14:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-07-20 04:14:12,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:12,108 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-07-20 04:14:12,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-20 04:14:12,322 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1660958730, now seen corresponding path program 1 times [2020-07-20 04:14:12,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:12,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254480207] [2020-07-20 04:14:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-20 04:14:12,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254480207] [2020-07-20 04:14:12,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792156008] [2020-07-20 04:14:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@14d3614c 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-07-20 04:14:13,096 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@14d3614c issued 3 check-sat command(s) [2020-07-20 04:14:13,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:14:13,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 04:14:13,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:14:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-20 04:14:13,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:14:13,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-20 04:14:13,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742886075] [2020-07-20 04:14:13,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:14:13,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:14:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:14:13,215 INFO L87 Difference]: Start difference. First operand 1033 states and 1261 transitions. Second operand 3 states. [2020-07-20 04:14:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:13,465 INFO L93 Difference]: Finished difference Result 2498 states and 3083 transitions. [2020-07-20 04:14:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:14:13,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-07-20 04:14:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:13,484 INFO L225 Difference]: With dead ends: 2498 [2020-07-20 04:14:13,484 INFO L226 Difference]: Without dead ends: 1485 [2020-07-20 04:14:13,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:14:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2020-07-20 04:14:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1473. [2020-07-20 04:14:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2020-07-20 04:14:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1781 transitions. [2020-07-20 04:14:13,755 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1781 transitions. Word has length 158 [2020-07-20 04:14:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:13,756 INFO L479 AbstractCegarLoop]: Abstraction has 1473 states and 1781 transitions. [2020-07-20 04:14:13,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:14:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1781 transitions. [2020-07-20 04:14:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 04:14:13,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:13,764 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, 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-07-20 04:14:13,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:14:13,979 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1249606409, now seen corresponding path program 1 times [2020-07-20 04:14:13,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:13,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445252446] [2020-07-20 04:14:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-07-20 04:14:14,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445252446] [2020-07-20 04:14:14,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960139196] [2020-07-20 04:14:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4da76e05 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-07-20 04:14:14,527 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4da76e05 issued 2 check-sat command(s) [2020-07-20 04:14:14,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:14:14,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 04:14:14,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:14:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-20 04:14:14,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:14:14,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 04:14:14,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124785577] [2020-07-20 04:14:14,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:14:14,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:14,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:14:14,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:14:14,741 INFO L87 Difference]: Start difference. First operand 1473 states and 1781 transitions. Second operand 3 states. [2020-07-20 04:14:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:14,987 INFO L93 Difference]: Finished difference Result 2919 states and 3592 transitions. [2020-07-20 04:14:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:14:14,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-07-20 04:14:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:15,006 INFO L225 Difference]: With dead ends: 2919 [2020-07-20 04:14:15,006 INFO L226 Difference]: Without dead ends: 1467 [2020-07-20 04:14:15,016 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:14:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-07-20 04:14:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2020-07-20 04:14:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2020-07-20 04:14:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1753 transitions. [2020-07-20 04:14:15,249 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1753 transitions. Word has length 176 [2020-07-20 04:14:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:15,250 INFO L479 AbstractCegarLoop]: Abstraction has 1467 states and 1753 transitions. [2020-07-20 04:14:15,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:14:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1753 transitions. [2020-07-20 04:14:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 04:14:15,264 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:15,265 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, 3, 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] [2020-07-20 04:14:15,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 04:14:15,479 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1366701111, now seen corresponding path program 1 times [2020-07-20 04:14:15,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:15,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007330880] [2020-07-20 04:14:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-20 04:14:15,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007330880] [2020-07-20 04:14:15,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641221356] [2020-07-20 04:14:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6144698f 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-07-20 04:14:15,891 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6144698f issued 1 check-sat command(s) [2020-07-20 04:14:15,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:14:15,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 04:14:15,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:14:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 04:14:15,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:14:15,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 04:14:15,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67634738] [2020-07-20 04:14:15,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:14:15,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:15,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:14:15,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:15,952 INFO L87 Difference]: Start difference. First operand 1467 states and 1753 transitions. Second operand 3 states. [2020-07-20 04:14:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:16,253 INFO L93 Difference]: Finished difference Result 3392 states and 4063 transitions. [2020-07-20 04:14:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:14:16,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-07-20 04:14:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:16,267 INFO L225 Difference]: With dead ends: 3392 [2020-07-20 04:14:16,267 INFO L226 Difference]: Without dead ends: 969 [2020-07-20 04:14:16,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-20 04:14:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 967. [2020-07-20 04:14:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-07-20 04:14:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1109 transitions. [2020-07-20 04:14:16,428 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1109 transitions. Word has length 177 [2020-07-20 04:14:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:16,429 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1109 transitions. [2020-07-20 04:14:16,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:14:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1109 transitions. [2020-07-20 04:14:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 04:14:16,435 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:16,436 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] [2020-07-20 04:14:16,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:14:16,650 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -816293866, now seen corresponding path program 1 times [2020-07-20 04:14:16,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:16,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061838927] [2020-07-20 04:14:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-07-20 04:14:17,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061838927] [2020-07-20 04:14:17,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803798077] [2020-07-20 04:14:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@42c8322e No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:14:17,366 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@42c8322e issued 4 check-sat command(s) [2020-07-20 04:14:17,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:14:17,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 04:14:17,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:14:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-20 04:14:17,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:14:17,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 04:14:17,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943377333] [2020-07-20 04:14:17,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:14:17,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:14:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:17,424 INFO L87 Difference]: Start difference. First operand 967 states and 1109 transitions. Second operand 3 states. [2020-07-20 04:14:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:17,567 INFO L93 Difference]: Finished difference Result 1731 states and 2028 transitions. [2020-07-20 04:14:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:14:17,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-07-20 04:14:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:17,578 INFO L225 Difference]: With dead ends: 1731 [2020-07-20 04:14:17,578 INFO L226 Difference]: Without dead ends: 967 [2020-07-20 04:14:17,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:14:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2020-07-20 04:14:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2020-07-20 04:14:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-07-20 04:14:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1101 transitions. [2020-07-20 04:14:17,698 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1101 transitions. Word has length 177 [2020-07-20 04:14:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:17,701 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1101 transitions. [2020-07-20 04:14:17,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:14:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1101 transitions. [2020-07-20 04:14:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-07-20 04:14:17,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:17,707 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] [2020-07-20 04:14:17,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 04:14:17,924 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:17,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:17,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2020-07-20 04:14:17,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:17,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265497581] [2020-07-20 04:14:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-20 04:14:18,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265497581] [2020-07-20 04:14:18,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757733604] [2020-07-20 04:14:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@17f9394a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:14:18,747 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@17f9394a issued 4 check-sat command(s) [2020-07-20 04:14:18,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:14:18,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 04:14:18,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:14:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-20 04:14:18,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 04:14:18,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-20 04:14:18,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121151878] [2020-07-20 04:14:18,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 04:14:18,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 04:14:18,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-20 04:14:18,938 INFO L87 Difference]: Start difference. First operand 967 states and 1101 transitions. Second operand 12 states. [2020-07-20 04:14:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:21,539 INFO L93 Difference]: Finished difference Result 1223 states and 1418 transitions. [2020-07-20 04:14:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 04:14:21,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2020-07-20 04:14:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:21,548 INFO L225 Difference]: With dead ends: 1223 [2020-07-20 04:14:21,548 INFO L226 Difference]: Without dead ends: 1220 [2020-07-20 04:14:21,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-20 04:14:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-07-20 04:14:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1172. [2020-07-20 04:14:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2020-07-20 04:14:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2020-07-20 04:14:21,671 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 178 [2020-07-20 04:14:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:21,672 INFO L479 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2020-07-20 04:14:21,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 04:14:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2020-07-20 04:14:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-07-20 04:14:21,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:21,677 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] [2020-07-20 04:14:21,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:14:21,891 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:21,892 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2020-07-20 04:14:21,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:21,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749277706] [2020-07-20 04:14:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:14:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-07-20 04:14:22,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749277706] [2020-07-20 04:14:22,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121405620] [2020-07-20 04:14:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f895163 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:14:22,402 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f895163 issued 4 check-sat command(s) [2020-07-20 04:14:22,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:14:22,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 04:14:22,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:14:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-20 04:14:22,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:14:22,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-20 04:14:22,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133678895] [2020-07-20 04:14:22,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:14:22,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:14:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:14:22,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:14:22,464 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 3 states. [2020-07-20 04:14:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:14:22,631 INFO L93 Difference]: Finished difference Result 1969 states and 2271 transitions. [2020-07-20 04:14:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:14:22,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-07-20 04:14:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:14:22,644 INFO L225 Difference]: With dead ends: 1969 [2020-07-20 04:14:22,644 INFO L226 Difference]: Without dead ends: 1186 [2020-07-20 04:14:22,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:14:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-07-20 04:14:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2020-07-20 04:14:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2020-07-20 04:14:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1353 transitions. [2020-07-20 04:14:22,853 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1353 transitions. Word has length 182 [2020-07-20 04:14:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:14:22,854 INFO L479 AbstractCegarLoop]: Abstraction has 1186 states and 1353 transitions. [2020-07-20 04:14:22,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:14:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1353 transitions. [2020-07-20 04:14:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-07-20 04:14:22,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:14:22,863 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-07-20 04:14:23,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-20 04:14:23,079 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:14:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:14:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2020-07-20 04:14:23,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:14:23,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998220108] [2020-07-20 04:14:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@12679fce [2020-07-20 04:14:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 04:14:23,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 04:14:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 04:14:23,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 04:14:23,392 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 04:14:23,392 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 04:14:23,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 04:14:23,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 04:14:23 BoogieIcfgContainer [2020-07-20 04:14:23,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 04:14:23,580 INFO L168 Benchmark]: Toolchain (without parser) took 31178.96 ms. Allocated memory was 142.6 MB in the beginning and 564.1 MB in the end (delta: 421.5 MB). Free memory was 99.5 MB in the beginning and 510.1 MB in the end (delta: -410.6 MB). Peak memory consumption was 442.1 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:23,581 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 142.6 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-20 04:14:23,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.01 ms. Allocated memory was 142.6 MB in the beginning and 201.9 MB in the end (delta: 59.2 MB). Free memory was 99.3 MB in the beginning and 180.7 MB in the end (delta: -81.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:23,583 INFO L168 Benchmark]: Boogie Preprocessor took 62.64 ms. Allocated memory is still 201.9 MB. Free memory was 180.7 MB in the beginning and 177.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:23,583 INFO L168 Benchmark]: RCFGBuilder took 847.00 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 145.1 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:23,584 INFO L168 Benchmark]: TraceAbstraction took 29628.13 ms. Allocated memory was 201.9 MB in the beginning and 564.1 MB in the end (delta: 362.3 MB). Free memory was 144.4 MB in the beginning and 510.1 MB in the end (delta: -365.7 MB). Peak memory consumption was 427.7 MB. Max. memory is 7.1 GB. [2020-07-20 04:14:23,588 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 142.6 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 630.01 ms. Allocated memory was 142.6 MB in the beginning and 201.9 MB in the end (delta: 59.2 MB). Free memory was 99.3 MB in the beginning and 180.7 MB in the end (delta: -81.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.64 ms. Allocated memory is still 201.9 MB. Free memory was 180.7 MB in the beginning and 177.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.00 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 145.1 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29628.13 ms. Allocated memory was 201.9 MB in the beginning and 564.1 MB in the end (delta: 362.3 MB). Free memory was 144.4 MB in the beginning and 510.1 MB in the end (delta: -365.7 MB). Peak memory consumption was 427.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=6, \old(M_E)=17, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=7, \old(t1_i)=16, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, 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] [L475] 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] [L479] 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] [L390] m_i = 1 [L391] 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] [L479] 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] [L480] 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] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] 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] [L423] 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] [L424] 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] [L172] COND TRUE m_i == 1 [L173] 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] [L177] COND TRUE t1_i == 1 [L178] 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] [L424] 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] [L425] 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] [L261] 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] [L266] 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] [L271] 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] [L276] 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] [L425] 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] [L426] 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] [L314] int tmp ; [L315] 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] [L319] 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] [L123] 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] [L126] 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] [L136] __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] [L138] 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] [L319] 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] [L319] tmp = is_master_triggered() [L321] 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] [L327] 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] [L142] 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] [L145] 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] [L155] __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] [L157] 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] [L327] 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] [L327] tmp___0 = is_transmit1_triggered() [L329] 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] [L426] 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] [L427] 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] [L289] 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] [L294] 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] [L299] 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] [L304] 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] [L427] 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] [L430] 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] [L433] 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] [L434] 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] [L208] 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] [L212] 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] [L215] 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] [L187] 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] [L190] COND TRUE m_st == 0 [L191] __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] [L203] 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] [L215] 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] [L215] tmp = exists_runnable_thread() [L217] 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] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] 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] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] 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] [L242] 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] [L90] 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] [L101] 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] [L103] t1_pc = 1 [L104] 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] [L242] 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] [L212] 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] [L215] 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] [L187] 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] [L190] COND TRUE m_st == 0 [L191] __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] [L203] 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] [L215] 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] [L215] tmp = exists_runnable_thread() [L217] 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] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] 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] [L228] 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] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] 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=0, token=0] [L45] 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=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] 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=0, token=0] [L51] 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] [L343] 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] [L314] int tmp ; [L315] 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] [L319] 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] [L123] 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] [L126] 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] [L136] __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] [L138] 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] [L319] 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] [L319] tmp = is_master_triggered() [L321] 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] [L327] 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] [L142] 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] [L145] 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] [L146] COND TRUE E_1 == 1 [L147] __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] [L157] 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] [L327] 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] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] 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] [L343] 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] [L51] 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=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] 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=0, token=0] [L228] 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] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] 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] [L242] 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] [L90] 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] [L93] 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] [L109] token += 1 [L110] 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] [L111] 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] [L343] 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] [L314] int tmp ; [L315] 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] [L319] 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] [L123] 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] [L126] 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] [L127] COND TRUE E_M == 1 [L128] __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] [L138] 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] [L319] 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] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] 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] [L327] 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] [L142] 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] [L145] 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] [L146] 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] [L155] __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] [L157] 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] [L327] 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] [L327] tmp___0 = is_transmit1_triggered() [L329] 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] [L343] 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] [L111] 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] [L112] 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] [L101] 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] [L103] t1_pc = 1 [L104] 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] [L242] 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] [L212] 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] [L215] 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] [L187] 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] [L190] COND TRUE m_st == 0 [L191] __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] [L203] 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] [L215] 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] [L215] tmp = exists_runnable_thread() [L217] 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] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] 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=1, tmp_ndt_2=1, token=1] [L228] 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] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] 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] [L37] 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] [L59] 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] [L64] 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] [L65] 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] [L70] 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] [L71] 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] 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] [L10] __VERIFIER_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 21 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2615 SDtfs, 5568 SDslu, 1387 SDs, 0 SdLazy, 7534 SolverSat, 2753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1815 GetRequests, 1626 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1473occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 1034 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3071 NumberOfCodeBlocks, 2721 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2867 ConstructedInterpolants, 0 QuantifiedInterpolants, 871578 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3416 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 1204/1280 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...