./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dee58858bceada86a9d77b57748794a4149b829dcc108044b7fcc9b2fa3dd4d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 21:07:14,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 21:07:14,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 21:07:14,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 21:07:14,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 21:07:14,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 21:07:14,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 21:07:14,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 21:07:14,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 21:07:14,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 21:07:14,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 21:07:14,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 21:07:14,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 21:07:14,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 21:07:14,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 21:07:14,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 21:07:14,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 21:07:14,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 21:07:14,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 21:07:14,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 21:07:14,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 21:07:14,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 21:07:14,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 21:07:14,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 21:07:14,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 21:07:14,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 21:07:14,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 21:07:14,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 21:07:14,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 21:07:14,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 21:07:14,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 21:07:14,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 21:07:14,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 21:07:14,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 21:07:14,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 21:07:14,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 21:07:14,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 21:07:14,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 21:07:14,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 21:07:14,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 21:07:14,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 21:07:14,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 21:07:14,831 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 21:07:14,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 21:07:14,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 21:07:14,832 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 21:07:14,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 21:07:14,833 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 21:07:14,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 21:07:14,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 21:07:14,834 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 21:07:14,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 21:07:14,835 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 21:07:14,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 21:07:14,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 21:07:14,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 21:07:14,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 21:07:14,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 21:07:14,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 21:07:14,836 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 21:07:14,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 21:07:14,836 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 21:07:14,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 21:07:14,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 21:07:14,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 21:07:14,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 21:07:14,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:07:14,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 21:07:14,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 21:07:14,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 21:07:14,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 21:07:14,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 21:07:14,838 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 21:07:14,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 21:07:14,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 21:07:14,839 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 21:07:14,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8dee58858bceada86a9d77b57748794a4149b829dcc108044b7fcc9b2fa3dd4d [2021-12-17 21:07:15,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 21:07:15,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 21:07:15,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 21:07:15,072 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 21:07:15,072 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 21:07:15,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2021-12-17 21:07:15,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2180e57e9/8e37ff34ddfe4bfda19a8005001b17f2/FLAG540245236 [2021-12-17 21:07:15,550 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 21:07:15,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2021-12-17 21:07:15,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2180e57e9/8e37ff34ddfe4bfda19a8005001b17f2/FLAG540245236 [2021-12-17 21:07:15,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2180e57e9/8e37ff34ddfe4bfda19a8005001b17f2 [2021-12-17 21:07:15,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 21:07:15,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 21:07:15,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 21:07:15,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 21:07:15,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 21:07:15,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:15" (1/1) ... [2021-12-17 21:07:15,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c7cd52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:15, skipping insertion in model container [2021-12-17 21:07:15,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:15" (1/1) ... [2021-12-17 21:07:15,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 21:07:15,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 21:07:16,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[914,927] [2021-12-17 21:07:16,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[7125,7138] [2021-12-17 21:07:16,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:07:16,190 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 21:07:16,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[914,927] [2021-12-17 21:07:16,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[7125,7138] [2021-12-17 21:07:16,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:07:16,254 INFO L208 MainTranslator]: Completed translation [2021-12-17 21:07:16,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16 WrapperNode [2021-12-17 21:07:16,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 21:07:16,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 21:07:16,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 21:07:16,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 21:07:16,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,329 INFO L137 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 577 [2021-12-17 21:07:16,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 21:07:16,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 21:07:16,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 21:07:16,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 21:07:16,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 21:07:16,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 21:07:16,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 21:07:16,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 21:07:16,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (1/1) ... [2021-12-17 21:07:16,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:07:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:07:16,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 21:07:16,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 21:07:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 21:07:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 21:07:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 21:07:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-17 21:07:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-17 21:07:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-17 21:07:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-17 21:07:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-17 21:07:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-17 21:07:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-17 21:07:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-17 21:07:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-17 21:07:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-17 21:07:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-17 21:07:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-17 21:07:16,525 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-17 21:07:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-17 21:07:16,525 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-17 21:07:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-17 21:07:16,525 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-17 21:07:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-17 21:07:16,525 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-17 21:07:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-17 21:07:16,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 21:07:16,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-17 21:07:16,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-17 21:07:16,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-17 21:07:16,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-17 21:07:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 21:07:16,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 21:07:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-17 21:07:16,549 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-17 21:07:16,704 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 21:07:16,721 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 21:07:17,146 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 21:07:17,161 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 21:07:17,164 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-17 21:07:17,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:17 BoogieIcfgContainer [2021-12-17 21:07:17,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 21:07:17,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 21:07:17,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 21:07:17,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 21:07:17,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:07:15" (1/3) ... [2021-12-17 21:07:17,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7851aff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:17, skipping insertion in model container [2021-12-17 21:07:17,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:16" (2/3) ... [2021-12-17 21:07:17,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7851aff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:17, skipping insertion in model container [2021-12-17 21:07:17,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:17" (3/3) ... [2021-12-17 21:07:17,172 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2021-12-17 21:07:17,176 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 21:07:17,176 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 21:07:17,226 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 21:07:17,232 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 21:07:17,232 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 21:07:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-17 21:07:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-17 21:07:17,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:17,271 INFO L514 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] [2021-12-17 21:07:17,272 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1988134503, now seen corresponding path program 1 times [2021-12-17 21:07:17,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:17,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752399730] [2021-12-17 21:07:17,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:17,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:17,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:17,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752399730] [2021-12-17 21:07:17,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752399730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:17,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:17,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:17,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124653515] [2021-12-17 21:07:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:17,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:17,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:17,637 INFO L87 Difference]: Start difference. First operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:07:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:18,673 INFO L93 Difference]: Finished difference Result 715 states and 1096 transitions. [2021-12-17 21:07:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 21:07:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-17 21:07:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:18,700 INFO L225 Difference]: With dead ends: 715 [2021-12-17 21:07:18,701 INFO L226 Difference]: Without dead ends: 441 [2021-12-17 21:07:18,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-17 21:07:18,709 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1104 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:18,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1128 Valid, 1493 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 21:07:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-12-17 21:07:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 374. [2021-12-17 21:07:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 313 states have internal predecessors, (449), 44 states have call successors, (44), 21 states have call predecessors, (44), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2021-12-17 21:07:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 545 transitions. [2021-12-17 21:07:18,810 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 545 transitions. Word has length 59 [2021-12-17 21:07:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:18,811 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 545 transitions. [2021-12-17 21:07:18,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:07:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 545 transitions. [2021-12-17 21:07:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-17 21:07:18,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:18,822 INFO L514 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] [2021-12-17 21:07:18,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 21:07:18,824 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1413346455, now seen corresponding path program 1 times [2021-12-17 21:07:18,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:18,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988226461] [2021-12-17 21:07:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:18,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:18,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:18,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988226461] [2021-12-17 21:07:18,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988226461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:18,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:18,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 21:07:18,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721001052] [2021-12-17 21:07:18,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:18,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:07:18,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:07:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:07:18,994 INFO L87 Difference]: Start difference. First operand 374 states and 545 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 21:07:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:20,504 INFO L93 Difference]: Finished difference Result 1335 states and 1884 transitions. [2021-12-17 21:07:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 21:07:20,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2021-12-17 21:07:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:20,511 INFO L225 Difference]: With dead ends: 1335 [2021-12-17 21:07:20,511 INFO L226 Difference]: Without dead ends: 1141 [2021-12-17 21:07:20,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 21:07:20,515 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 2208 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:20,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2222 Valid, 1965 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-17 21:07:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2021-12-17 21:07:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1024. [2021-12-17 21:07:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 817 states have (on average 1.4026927784577723) internal successors, (1146), 838 states have internal predecessors, (1146), 111 states have call successors, (111), 81 states have call predecessors, (111), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2021-12-17 21:07:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1398 transitions. [2021-12-17 21:07:20,579 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1398 transitions. Word has length 59 [2021-12-17 21:07:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:20,580 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1398 transitions. [2021-12-17 21:07:20,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 21:07:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1398 transitions. [2021-12-17 21:07:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-17 21:07:20,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:20,581 INFO L514 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] [2021-12-17 21:07:20,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 21:07:20,582 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash -890025784, now seen corresponding path program 1 times [2021-12-17 21:07:20,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:20,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720026589] [2021-12-17 21:07:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:20,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:20,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720026589] [2021-12-17 21:07:20,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720026589] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:20,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:20,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:07:20,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566614807] [2021-12-17 21:07:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:20,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:07:20,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:20,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:07:20,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:07:20,719 INFO L87 Difference]: Start difference. First operand 1024 states and 1398 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:21,294 INFO L93 Difference]: Finished difference Result 1931 states and 2607 transitions. [2021-12-17 21:07:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:07:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-17 21:07:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:21,300 INFO L225 Difference]: With dead ends: 1931 [2021-12-17 21:07:21,301 INFO L226 Difference]: Without dead ends: 1094 [2021-12-17 21:07:21,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:07:21,304 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 488 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:21,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1706 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:07:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-12-17 21:07:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1044. [2021-12-17 21:07:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 833 states have (on average 1.3877551020408163) internal successors, (1156), 854 states have internal predecessors, (1156), 111 states have call successors, (111), 81 states have call predecessors, (111), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2021-12-17 21:07:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1412 transitions. [2021-12-17 21:07:21,392 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1412 transitions. Word has length 59 [2021-12-17 21:07:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:21,393 INFO L470 AbstractCegarLoop]: Abstraction has 1044 states and 1412 transitions. [2021-12-17 21:07:21,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1412 transitions. [2021-12-17 21:07:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-17 21:07:21,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:21,395 INFO L514 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] [2021-12-17 21:07:21,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 21:07:21,395 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash -615266170, now seen corresponding path program 1 times [2021-12-17 21:07:21,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:21,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564392729] [2021-12-17 21:07:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:21,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:21,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:21,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564392729] [2021-12-17 21:07:21,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564392729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:21,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:21,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:07:21,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441453074] [2021-12-17 21:07:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:21,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:07:21,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:21,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:07:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:07:21,511 INFO L87 Difference]: Start difference. First operand 1044 states and 1412 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:22,109 INFO L93 Difference]: Finished difference Result 2009 states and 2687 transitions. [2021-12-17 21:07:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:07:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-17 21:07:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:22,115 INFO L225 Difference]: With dead ends: 2009 [2021-12-17 21:07:22,115 INFO L226 Difference]: Without dead ends: 1152 [2021-12-17 21:07:22,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:07:22,118 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 489 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:22,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1699 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-12-17 21:07:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1094. [2021-12-17 21:07:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 873 states have (on average 1.3699885452462772) internal successors, (1196), 894 states have internal predecessors, (1196), 111 states have call successors, (111), 81 states have call predecessors, (111), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2021-12-17 21:07:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1462 transitions. [2021-12-17 21:07:22,169 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1462 transitions. Word has length 59 [2021-12-17 21:07:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:22,169 INFO L470 AbstractCegarLoop]: Abstraction has 1094 states and 1462 transitions. [2021-12-17 21:07:22,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:07:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1462 transitions. [2021-12-17 21:07:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-17 21:07:22,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:22,170 INFO L514 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] [2021-12-17 21:07:22,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 21:07:22,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:22,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1874262792, now seen corresponding path program 1 times [2021-12-17 21:07:22,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:22,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833387941] [2021-12-17 21:07:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:22,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:22,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:22,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833387941] [2021-12-17 21:07:22,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833387941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:22,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:22,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:22,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538663937] [2021-12-17 21:07:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:22,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:22,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:22,256 INFO L87 Difference]: Start difference. First operand 1094 states and 1462 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:07:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:22,960 INFO L93 Difference]: Finished difference Result 1934 states and 2543 transitions. [2021-12-17 21:07:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:07:22,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-17 21:07:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:22,967 INFO L225 Difference]: With dead ends: 1934 [2021-12-17 21:07:22,967 INFO L226 Difference]: Without dead ends: 1267 [2021-12-17 21:07:22,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-12-17 21:07:22,975 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1001 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:22,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 1225 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2021-12-17 21:07:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1110. [2021-12-17 21:07:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 885 states have (on average 1.3615819209039548) internal successors, (1205), 908 states have internal predecessors, (1205), 113 states have call successors, (113), 83 states have call predecessors, (113), 110 states have return successors, (159), 121 states have call predecessors, (159), 110 states have call successors, (159) [2021-12-17 21:07:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1477 transitions. [2021-12-17 21:07:23,043 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1477 transitions. Word has length 59 [2021-12-17 21:07:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:23,044 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1477 transitions. [2021-12-17 21:07:23,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:07:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1477 transitions. [2021-12-17 21:07:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-17 21:07:23,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:23,045 INFO L514 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] [2021-12-17 21:07:23,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 21:07:23,046 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -119881914, now seen corresponding path program 1 times [2021-12-17 21:07:23,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:23,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040144468] [2021-12-17 21:07:23,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:23,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 21:07:23,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 21:07:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 21:07:23,112 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 21:07:23,112 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 21:07:23,113 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-17 21:07:23,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-17 21:07:23,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 21:07:23,121 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-17 21:07:23,124 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 21:07:23,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 09:07:23 BoogieIcfgContainer [2021-12-17 21:07:23,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 21:07:23,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 21:07:23,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 21:07:23,215 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 21:07:23,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:17" (3/4) ... [2021-12-17 21:07:23,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 21:07:23,298 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 21:07:23,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 21:07:23,299 INFO L158 Benchmark]: Toolchain (without parser) took 7387.89ms. Allocated memory was 73.4MB in the beginning and 205.5MB in the end (delta: 132.1MB). Free memory was 38.6MB in the beginning and 106.5MB in the end (delta: -67.9MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2021-12-17 21:07:23,299 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 21:07:23,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.26ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 38.4MB in the beginning and 56.8MB in the end (delta: -18.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2021-12-17 21:07:23,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.43ms. Allocated memory is still 88.1MB. Free memory was 56.6MB in the beginning and 53.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:07:23,300 INFO L158 Benchmark]: Boogie Preprocessor took 87.44ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 21:07:23,300 INFO L158 Benchmark]: RCFGBuilder took 736.60ms. Allocated memory is still 88.1MB. Free memory was 50.7MB in the beginning and 43.0MB in the end (delta: 7.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2021-12-17 21:07:23,302 INFO L158 Benchmark]: TraceAbstraction took 6046.23ms. Allocated memory was 88.1MB in the beginning and 205.5MB in the end (delta: 117.4MB). Free memory was 42.4MB in the beginning and 120.1MB in the end (delta: -77.7MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2021-12-17 21:07:23,302 INFO L158 Benchmark]: Witness Printer took 84.25ms. Allocated memory is still 205.5MB. Free memory was 119.0MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 21:07:23,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.26ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 38.4MB in the beginning and 56.8MB in the end (delta: -18.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.43ms. Allocated memory is still 88.1MB. Free memory was 56.6MB in the beginning and 53.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.44ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 736.60ms. Allocated memory is still 88.1MB. Free memory was 50.7MB in the beginning and 43.0MB in the end (delta: 7.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6046.23ms. Allocated memory was 88.1MB in the beginning and 205.5MB in the end (delta: 117.4MB). Free memory was 42.4MB in the beginning and 120.1MB in the end (delta: -77.7MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 84.25ms. Allocated memory is still 205.5MB. Free memory was 119.0MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int m_st ; [L506] int t1_st ; [L507] int t2_st ; [L508] int t3_st ; [L509] int t4_st ; [L510] int m_i ; [L511] int t1_i ; [L512] int t2_i ; [L513] int t3_i ; [L514] int t4_i ; [L515] int M_E = 2; [L516] int T1_E = 2; [L517] int T2_E = 2; [L518] int T3_E = 2; [L519] int T4_E = 2; [L520] int E_M = 2; [L521] int E_1 = 2; [L522] int E_2 = 2; [L523] int E_3 = 2; [L524] int E_4 = 2; [L531] int token ; [L533] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L1337] COND TRUE __VERIFIER_nondet_int() [L1338] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 284 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5352 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5290 mSDsluCounter, 8088 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5938 mSDsCounter, 1188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4774 IncrementalHoareTripleChecker+Invalid, 5962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1188 mSolverCounterUnsat, 2150 mSDtfsCounter, 4774 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1110occurred in iteration=5, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 449 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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! [2021-12-17 21:07:23,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE