./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 eb692b52 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-?-eb692b5 [2022-07-19 20:35:45,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 20:35:45,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 20:35:45,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 20:35:45,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 20:35:45,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 20:35:45,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 20:35:45,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 20:35:45,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 20:35:45,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 20:35:45,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 20:35:45,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 20:35:45,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 20:35:45,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 20:35:45,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 20:35:45,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 20:35:45,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 20:35:45,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 20:35:45,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 20:35:45,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 20:35:45,688 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 20:35:45,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 20:35:45,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 20:35:45,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 20:35:45,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 20:35:45,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 20:35:45,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 20:35:45,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 20:35:45,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 20:35:45,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 20:35:45,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 20:35:45,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 20:35:45,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 20:35:45,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 20:35:45,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 20:35:45,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 20:35:45,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 20:35:45,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 20:35:45,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 20:35:45,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 20:35:45,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 20:35:45,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 20:35:45,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 20:35:45,742 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 20:35:45,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 20:35:45,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 20:35:45,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 20:35:45,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 20:35:45,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 20:35:45,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 20:35:45,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 20:35:45,746 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 20:35:45,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 20:35:45,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 20:35:45,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 20:35:45,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 20:35:45,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 20:35:45,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 20:35:45,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 20:35:45,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 20:35:45,748 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 20:35:45,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 20:35:45,749 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 20:35:45,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 20:35:45,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 20:35:45,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 20:35:45,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 20:35:45,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:35:45,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 20:35:45,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 20:35:45,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 20:35:45,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 20:35:45,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 20:35:45,751 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 20:35:45,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 20:35:45,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 20:35:45,751 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 [2022-07-19 20:35:45,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 20:35:46,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 20:35:46,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 20:35:46,023 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 20:35:46,024 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 20:35:46,025 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 [2022-07-19 20:35:46,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138cd03cb/279b74f3c4754b2c9b6839080640e5c9/FLAG7c9bf84f2 [2022-07-19 20:35:46,452 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 20:35:46,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-07-19 20:35:46,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138cd03cb/279b74f3c4754b2c9b6839080640e5c9/FLAG7c9bf84f2 [2022-07-19 20:35:46,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138cd03cb/279b74f3c4754b2c9b6839080640e5c9 [2022-07-19 20:35:46,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 20:35:46,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 20:35:46,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 20:35:46,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 20:35:46,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 20:35:46,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430a2312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46, skipping insertion in model container [2022-07-19 20:35:46,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 20:35:46,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 20:35:46,676 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] [2022-07-19 20:35:46,748 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] [2022-07-19 20:35:46,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:35:46,824 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 20:35:46,837 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] [2022-07-19 20:35:46,861 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] [2022-07-19 20:35:46,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:35:46,899 INFO L208 MainTranslator]: Completed translation [2022-07-19 20:35:46,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46 WrapperNode [2022-07-19 20:35:46,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 20:35:46,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 20:35:46,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 20:35:46,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 20:35:46,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,965 INFO L137 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 577 [2022-07-19 20:35:46,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 20:35:46,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 20:35:46,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 20:35:46,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 20:35:46,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:46,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 20:35:46,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 20:35:46,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 20:35:46,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 20:35:47,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (1/1) ... [2022-07-19 20:35:47,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:35:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:35:47,027 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) [2022-07-19 20:35:47,048 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 [2022-07-19 20:35:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 20:35:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-19 20:35:47,071 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-19 20:35:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-19 20:35:47,073 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-19 20:35:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-19 20:35:47,073 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-19 20:35:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-19 20:35:47,073 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-19 20:35:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-19 20:35:47,074 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-19 20:35:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-19 20:35:47,074 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-19 20:35:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-19 20:35:47,074 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-19 20:35:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-19 20:35:47,074 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-19 20:35:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-19 20:35:47,075 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-19 20:35:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-19 20:35:47,075 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-19 20:35:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-19 20:35:47,075 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-19 20:35:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 20:35:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-19 20:35:47,076 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-19 20:35:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-19 20:35:47,076 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-19 20:35:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 20:35:47,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 20:35:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-19 20:35:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-19 20:35:47,164 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 20:35:47,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 20:35:47,724 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 20:35:47,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 20:35:47,737 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-19 20:35:47,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:35:47 BoogieIcfgContainer [2022-07-19 20:35:47,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 20:35:47,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 20:35:47,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 20:35:47,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 20:35:47,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 08:35:46" (1/3) ... [2022-07-19 20:35:47,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6360887a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:35:47, skipping insertion in model container [2022-07-19 20:35:47,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:35:46" (2/3) ... [2022-07-19 20:35:47,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6360887a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:35:47, skipping insertion in model container [2022-07-19 20:35:47,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:35:47" (3/3) ... [2022-07-19 20:35:47,745 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-07-19 20:35:47,758 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 20:35:47,759 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 20:35:47,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 20:35:47,806 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35a20a0e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4121a346 [2022-07-19 20:35:47,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 20:35:47,811 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) [2022-07-19 20:35:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 20:35:47,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:35:47,822 INFO L195 NwaCegarLoop]: 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] [2022-07-19 20:35:47,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:35:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:35:47,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1988134503, now seen corresponding path program 1 times [2022-07-19 20:35:47,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:35:47,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510347065] [2022-07-19 20:35:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:35:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:35:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:35:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:35:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:35:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:35:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:35:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:35:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:35:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:35:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:35:48,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510347065] [2022-07-19 20:35:48,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510347065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:35:48,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:35:48,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:35:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125396551] [2022-07-19 20:35:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:35:48,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:35:48,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:35:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:35:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:35:48,155 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) [2022-07-19 20:35:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:35:49,193 INFO L93 Difference]: Finished difference Result 715 states and 1096 transitions. [2022-07-19 20:35:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 20:35:49,195 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 [2022-07-19 20:35:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:35:49,207 INFO L225 Difference]: With dead ends: 715 [2022-07-19 20:35:49,207 INFO L226 Difference]: Without dead ends: 441 [2022-07-19 20:35:49,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-19 20:35:49,214 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 1104 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 20:35:49,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 1445 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 20:35:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-19 20:35:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 374. [2022-07-19 20:35:49,309 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) [2022-07-19 20:35:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 545 transitions. [2022-07-19 20:35:49,313 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 545 transitions. Word has length 59 [2022-07-19 20:35:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:35:49,313 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 545 transitions. [2022-07-19 20:35:49,314 INFO L496 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) [2022-07-19 20:35:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 545 transitions. [2022-07-19 20:35:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 20:35:49,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:35:49,317 INFO L195 NwaCegarLoop]: 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] [2022-07-19 20:35:49,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 20:35:49,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:35:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:35:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1413346455, now seen corresponding path program 1 times [2022-07-19 20:35:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:35:49,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598855528] [2022-07-19 20:35:49,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:35:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:35:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:35:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:35:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:35:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:35:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:35:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:35:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:35:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:35:49,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:35:49,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598855528] [2022-07-19 20:35:49,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598855528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:35:49,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:35:49,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 20:35:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426037944] [2022-07-19 20:35:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:35:49,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 20:35:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:35:49,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 20:35:49,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:35:49,485 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) [2022-07-19 20:35:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:35:51,139 INFO L93 Difference]: Finished difference Result 1335 states and 1884 transitions. [2022-07-19 20:35:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 20:35:51,139 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 [2022-07-19 20:35:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:35:51,149 INFO L225 Difference]: With dead ends: 1335 [2022-07-19 20:35:51,150 INFO L226 Difference]: Without dead ends: 1141 [2022-07-19 20:35:51,155 INFO L412 NwaCegarLoop]: 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 [2022-07-19 20:35:51,156 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 2208 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 20:35:51,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 1927 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 20:35:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-07-19 20:35:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1024. [2022-07-19 20:35:51,253 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) [2022-07-19 20:35:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1398 transitions. [2022-07-19 20:35:51,261 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1398 transitions. Word has length 59 [2022-07-19 20:35:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:35:51,262 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1398 transitions. [2022-07-19 20:35:51,262 INFO L496 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) [2022-07-19 20:35:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1398 transitions. [2022-07-19 20:35:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 20:35:51,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:35:51,270 INFO L195 NwaCegarLoop]: 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] [2022-07-19 20:35:51,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 20:35:51,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:35:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:35:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash -890025784, now seen corresponding path program 1 times [2022-07-19 20:35:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:35:51,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846266111] [2022-07-19 20:35:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:35:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:35:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:35:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:35:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:35:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:35:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:35:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:35:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:35:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:35:51,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:35:51,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846266111] [2022-07-19 20:35:51,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846266111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:35:51,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:35:51,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:35:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79304091] [2022-07-19 20:35:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:35:51,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:35:51,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:35:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:35:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:35:51,466 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) [2022-07-19 20:35:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:35:52,224 INFO L93 Difference]: Finished difference Result 1931 states and 2607 transitions. [2022-07-19 20:35:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 20:35:52,225 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 [2022-07-19 20:35:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:35:52,233 INFO L225 Difference]: With dead ends: 1931 [2022-07-19 20:35:52,233 INFO L226 Difference]: Without dead ends: 1094 [2022-07-19 20:35:52,238 INFO L412 NwaCegarLoop]: 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 [2022-07-19 20:35:52,242 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 488 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 20:35:52,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1561 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 20:35:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-07-19 20:35:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1044. [2022-07-19 20:35:52,298 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) [2022-07-19 20:35:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1412 transitions. [2022-07-19 20:35:52,304 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1412 transitions. Word has length 59 [2022-07-19 20:35:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:35:52,305 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 1412 transitions. [2022-07-19 20:35:52,305 INFO L496 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) [2022-07-19 20:35:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1412 transitions. [2022-07-19 20:35:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 20:35:52,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:35:52,307 INFO L195 NwaCegarLoop]: 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] [2022-07-19 20:35:52,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 20:35:52,307 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:35:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:35:52,308 INFO L85 PathProgramCache]: Analyzing trace with hash -615266170, now seen corresponding path program 1 times [2022-07-19 20:35:52,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:35:52,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815127993] [2022-07-19 20:35:52,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:35:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:35:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:35:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:35:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:35:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:35:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:35:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:35:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:35:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:35:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:35:52,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815127993] [2022-07-19 20:35:52,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815127993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:35:52,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:35:52,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:35:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246026167] [2022-07-19 20:35:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:35:52,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:35:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:35:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:35:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:35:52,453 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) [2022-07-19 20:35:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:35:53,170 INFO L93 Difference]: Finished difference Result 2009 states and 2687 transitions. [2022-07-19 20:35:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 20:35:53,170 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 [2022-07-19 20:35:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:35:53,176 INFO L225 Difference]: With dead ends: 2009 [2022-07-19 20:35:53,176 INFO L226 Difference]: Without dead ends: 1152 [2022-07-19 20:35:53,178 INFO L412 NwaCegarLoop]: 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 [2022-07-19 20:35:53,179 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 489 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 20:35:53,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1559 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 20:35:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-07-19 20:35:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1094. [2022-07-19 20:35:53,224 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) [2022-07-19 20:35:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1462 transitions. [2022-07-19 20:35:53,228 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1462 transitions. Word has length 59 [2022-07-19 20:35:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:35:53,229 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 1462 transitions. [2022-07-19 20:35:53,229 INFO L496 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) [2022-07-19 20:35:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1462 transitions. [2022-07-19 20:35:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 20:35:53,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:35:53,230 INFO L195 NwaCegarLoop]: 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] [2022-07-19 20:35:53,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 20:35:53,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:35:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:35:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1874262792, now seen corresponding path program 1 times [2022-07-19 20:35:53,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:35:53,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816687897] [2022-07-19 20:35:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:35:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:35:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:35:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:35:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:35:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:35:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:35:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:35:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:35:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:35:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:35:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:35:53,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816687897] [2022-07-19 20:35:53,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816687897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:35:53,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:35:53,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:35:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709684026] [2022-07-19 20:35:53,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:35:53,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:35:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:35:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:35:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:35:53,333 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) [2022-07-19 20:35:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:35:54,116 INFO L93 Difference]: Finished difference Result 1934 states and 2543 transitions. [2022-07-19 20:35:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 20:35:54,116 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 [2022-07-19 20:35:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:35:54,122 INFO L225 Difference]: With dead ends: 1934 [2022-07-19 20:35:54,122 INFO L226 Difference]: Without dead ends: 1267 [2022-07-19 20:35:54,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-19 20:35:54,124 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 1001 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 20:35:54,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 1187 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 20:35:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-07-19 20:35:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1110. [2022-07-19 20:35:54,166 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) [2022-07-19 20:35:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1477 transitions. [2022-07-19 20:35:54,170 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1477 transitions. Word has length 59 [2022-07-19 20:35:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:35:54,171 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1477 transitions. [2022-07-19 20:35:54,171 INFO L496 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) [2022-07-19 20:35:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1477 transitions. [2022-07-19 20:35:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 20:35:54,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:35:54,172 INFO L195 NwaCegarLoop]: 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] [2022-07-19 20:35:54,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 20:35:54,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:35:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:35:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash -119881914, now seen corresponding path program 1 times [2022-07-19 20:35:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:35:54,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978011613] [2022-07-19 20:35:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:35:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:35:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 20:35:54,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 20:35:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 20:35:54,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 20:35:54,220 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 20:35:54,221 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-19 20:35:54,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-19 20:35:54,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 20:35:54,225 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-19 20:35:54,228 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 20:35:54,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 08:35:54 BoogieIcfgContainer [2022-07-19 20:35:54,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 20:35:54,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 20:35:54,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 20:35:54,319 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 20:35:54,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:35:47" (3/4) ... [2022-07-19 20:35:54,321 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 20:35:54,385 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 20:35:54,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 20:35:54,386 INFO L158 Benchmark]: Toolchain (without parser) took 7898.47ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 58.1MB in the beginning and 49.6MB in the end (delta: 8.5MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2022-07-19 20:35:54,387 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 75.0MB in the beginning and 74.9MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 20:35:54,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.76ms. Allocated memory is still 94.4MB. Free memory was 57.9MB in the beginning and 63.4MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 20:35:54,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.33ms. Allocated memory is still 94.4MB. Free memory was 63.4MB in the beginning and 60.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 20:35:54,387 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 57.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 20:35:54,388 INFO L158 Benchmark]: RCFGBuilder took 740.08ms. Allocated memory is still 94.4MB. Free memory was 57.3MB in the beginning and 59.2MB in the end (delta: -1.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2022-07-19 20:35:54,388 INFO L158 Benchmark]: TraceAbstraction took 6577.52ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 58.7MB in the beginning and 59.0MB in the end (delta: -303.3kB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2022-07-19 20:35:54,388 INFO L158 Benchmark]: Witness Printer took 67.58ms. Allocated memory is still 136.3MB. Free memory was 59.0MB in the beginning and 49.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 20:35:54,390 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.20ms. Allocated memory is still 94.4MB. Free memory was 75.0MB in the beginning and 74.9MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.76ms. Allocated memory is still 94.4MB. Free memory was 57.9MB in the beginning and 63.4MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.33ms. Allocated memory is still 94.4MB. Free memory was 63.4MB in the beginning and 60.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 57.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 740.08ms. Allocated memory is still 94.4MB. Free memory was 57.3MB in the beginning and 59.2MB in the end (delta: -1.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6577.52ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 58.7MB in the beginning and 59.0MB in the end (delta: -303.3kB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * Witness Printer took 67.58ms. Allocated memory is still 136.3MB. Free memory was 59.0MB in the beginning and 49.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 6.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5352 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5290 mSDsluCounter, 7679 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5531 mSDsCounter, 1188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5171 IncrementalHoareTripleChecker+Invalid, 6359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1188 mSolverCounterUnsat, 2148 mSDtfsCounter, 5171 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.0s 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 449 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 680 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! [2022-07-19 20:35:54,428 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