./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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.03.cil-2.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 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 02:33:30,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 02:33:30,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 02:33:30,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 02:33:30,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 02:33:30,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 02:33:30,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 02:33:30,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 02:33:30,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 02:33:30,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 02:33:30,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 02:33:30,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 02:33:30,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 02:33:30,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 02:33:30,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 02:33:30,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 02:33:30,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 02:33:30,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 02:33:30,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 02:33:30,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 02:33:30,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 02:33:30,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 02:33:30,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 02:33:30,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 02:33:30,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 02:33:30,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 02:33:30,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 02:33:30,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 02:33:30,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 02:33:30,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 02:33:30,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 02:33:30,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 02:33:30,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 02:33:30,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 02:33:30,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 02:33:30,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 02:33:30,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 02:33:30,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 02:33:30,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 02:33:30,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 02:33:30,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 02:33:30,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 02:33:30,683 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 02:33:30,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 02:33:30,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 02:33:30,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 02:33:30,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 02:33:30,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 02:33:30,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 02:33:30,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 02:33:30,686 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 02:33:30,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 02:33:30,687 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 02:33:30,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 02:33:30,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 02:33:30,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 02:33:30,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 02:33:30,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 02:33:30,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 02:33:30,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:33:30,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 02:33:30,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 02:33:30,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 02:33:30,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 02:33:30,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 02:33:30,690 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 02:33:30,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 02:33:30,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 02:33:30,690 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 -> 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f [2021-12-28 02:33:31,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 02:33:31,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 02:33:31,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 02:33:31,079 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 02:33:31,079 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 02:33:31,080 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.03.cil-2.c [2021-12-28 02:33:31,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a656f628/bee11627a2084cb09cc36290bbed8ba3/FLAG4d9bae90c [2021-12-28 02:33:31,601 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 02:33:31,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2021-12-28 02:33:31,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a656f628/bee11627a2084cb09cc36290bbed8ba3/FLAG4d9bae90c [2021-12-28 02:33:31,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a656f628/bee11627a2084cb09cc36290bbed8ba3 [2021-12-28 02:33:31,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 02:33:31,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 02:33:31,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 02:33:31,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 02:33:31,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 02:33:31,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:33:31" (1/1) ... [2021-12-28 02:33:31,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e9d1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:31, skipping insertion in model container [2021-12-28 02:33:31,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:33:31" (1/1) ... [2021-12-28 02:33:31,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 02:33:31,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 02:33:31,814 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.03.cil-2.c[914,927] [2021-12-28 02:33:31,898 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.03.cil-2.c[7125,7138] [2021-12-28 02:33:31,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:33:31,948 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 02:33:31,959 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.03.cil-2.c[914,927] [2021-12-28 02:33:31,977 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.03.cil-2.c[7125,7138] [2021-12-28 02:33:32,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:33:32,021 INFO L208 MainTranslator]: Completed translation [2021-12-28 02:33:32,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32 WrapperNode [2021-12-28 02:33:32,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 02:33:32,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 02:33:32,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 02:33:32,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 02:33:32,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,081 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 519 [2021-12-28 02:33:32,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 02:33:32,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 02:33:32,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 02:33:32,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 02:33:32,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 02:33:32,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 02:33:32,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 02:33:32,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 02:33:32,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (1/1) ... [2021-12-28 02:33:32,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:33:32,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 02:33:32,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 02:33:32,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 02:33:32,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 02:33:32,185 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-28 02:33:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-28 02:33:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-28 02:33:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-28 02:33:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-28 02:33:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-28 02:33:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-28 02:33:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-28 02:33:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-28 02:33:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-28 02:33:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-28 02:33:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-28 02:33:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-28 02:33:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-28 02:33:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-28 02:33:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-28 02:33:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-28 02:33:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-28 02:33:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-28 02:33:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-28 02:33:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-28 02:33:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-28 02:33:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 02:33:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-28 02:33:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-28 02:33:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-28 02:33:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-28 02:33:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 02:33:32,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 02:33:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-28 02:33:32,189 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-28 02:33:32,282 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 02:33:32,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 02:33:32,633 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 02:33:32,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 02:33:32,639 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-12-28 02:33:32,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:33:32 BoogieIcfgContainer [2021-12-28 02:33:32,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 02:33:32,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 02:33:32,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 02:33:32,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 02:33:32,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:33:31" (1/3) ... [2021-12-28 02:33:32,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d57cc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:33:32, skipping insertion in model container [2021-12-28 02:33:32,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:33:32" (2/3) ... [2021-12-28 02:33:32,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d57cc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:33:32, skipping insertion in model container [2021-12-28 02:33:32,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:33:32" (3/3) ... [2021-12-28 02:33:32,645 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2021-12-28 02:33:32,648 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 02:33:32,648 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 02:33:32,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 02:33:32,697 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 02:33:32,698 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-28 02:33:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-28 02:33:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 02:33:32,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 02:33:32,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:33:32,730 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 02:33:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:33:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1774585736, now seen corresponding path program 1 times [2021-12-28 02:33:32,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:33:32,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122822847] [2021-12-28 02:33:32,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:33:32,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:33:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 02:33:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 02:33:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:33,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 02:33:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 02:33:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 02:33:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 02:33:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 02:33:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:33:33,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:33:33,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122822847] [2021-12-28 02:33:33,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122822847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:33:33,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:33:33,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:33:33,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62709965] [2021-12-28 02:33:33,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:33:33,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:33:33,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:33:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:33:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:33:33,067 INFO L87 Difference]: Start difference. First operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 02:33:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 02:33:33,863 INFO L93 Difference]: Finished difference Result 635 states and 966 transitions. [2021-12-28 02:33:33,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 02:33:33,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-28 02:33:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 02:33:33,874 INFO L225 Difference]: With dead ends: 635 [2021-12-28 02:33:33,874 INFO L226 Difference]: Without dead ends: 385 [2021-12-28 02:33:33,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-28 02:33:33,880 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 657 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 02:33:33,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 1056 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 02:33:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-12-28 02:33:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2021-12-28 02:33:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2021-12-28 02:33:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 491 transitions. [2021-12-28 02:33:33,927 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 491 transitions. Word has length 59 [2021-12-28 02:33:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 02:33:33,927 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 491 transitions. [2021-12-28 02:33:33,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 02:33:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 491 transitions. [2021-12-28 02:33:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 02:33:33,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 02:33:33,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:33:33,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 02:33:33,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 02:33:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:33:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1011936105, now seen corresponding path program 1 times [2021-12-28 02:33:33,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:33:33,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294914200] [2021-12-28 02:33:33,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:33:33,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:33:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 02:33:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 02:33:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 02:33:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 02:33:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 02:33:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 02:33:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 02:33:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:33:34,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:33:34,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294914200] [2021-12-28 02:33:34,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294914200] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:33:34,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:33:34,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:33:34,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838605107] [2021-12-28 02:33:34,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:33:34,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:33:34,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:33:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:33:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:33:34,067 INFO L87 Difference]: Start difference. First operand 345 states and 491 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 02:33:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 02:33:34,795 INFO L93 Difference]: Finished difference Result 694 states and 970 transitions. [2021-12-28 02:33:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:33:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-28 02:33:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 02:33:34,801 INFO L225 Difference]: With dead ends: 694 [2021-12-28 02:33:34,801 INFO L226 Difference]: Without dead ends: 516 [2021-12-28 02:33:34,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-28 02:33:34,806 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 722 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 02:33:34,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [743 Valid, 1479 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 02:33:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-12-28 02:33:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 441. [2021-12-28 02:33:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2021-12-28 02:33:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 625 transitions. [2021-12-28 02:33:34,861 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 625 transitions. Word has length 59 [2021-12-28 02:33:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 02:33:34,862 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 625 transitions. [2021-12-28 02:33:34,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 02:33:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 625 transitions. [2021-12-28 02:33:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 02:33:34,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 02:33:34,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:33:34,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 02:33:34,867 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 02:33:34,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:33:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -118449767, now seen corresponding path program 1 times [2021-12-28 02:33:34,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:33:34,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050481613] [2021-12-28 02:33:34,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:33:34,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:33:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 02:33:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 02:33:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 02:33:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 02:33:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 02:33:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 02:33:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 02:33:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:33:35,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:33:35,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050481613] [2021-12-28 02:33:35,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050481613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:33:35,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:33:35,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:33:35,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38545270] [2021-12-28 02:33:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:33:35,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:33:35,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:33:35,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:33:35,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:33:35,023 INFO L87 Difference]: Start difference. First operand 441 states and 625 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 02:33:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 02:33:35,586 INFO L93 Difference]: Finished difference Result 743 states and 1040 transitions. [2021-12-28 02:33:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 02:33:35,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-28 02:33:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 02:33:35,588 INFO L225 Difference]: With dead ends: 743 [2021-12-28 02:33:35,588 INFO L226 Difference]: Without dead ends: 475 [2021-12-28 02:33:35,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-28 02:33:35,590 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 428 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 02:33:35,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 1402 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 02:33:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-12-28 02:33:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 446. [2021-12-28 02:33:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2021-12-28 02:33:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 628 transitions. [2021-12-28 02:33:35,613 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 628 transitions. Word has length 59 [2021-12-28 02:33:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 02:33:35,613 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 628 transitions. [2021-12-28 02:33:35,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 02:33:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 628 transitions. [2021-12-28 02:33:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 02:33:35,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 02:33:35,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:33:35,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 02:33:35,621 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 02:33:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:33:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash 156309847, now seen corresponding path program 1 times [2021-12-28 02:33:35,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:33:35,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260780969] [2021-12-28 02:33:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:33:35,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:33:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 02:33:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 02:33:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 02:33:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 02:33:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 02:33:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 02:33:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 02:33:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:33:35,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:33:35,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260780969] [2021-12-28 02:33:35,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260780969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:33:35,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:33:35,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:33:35,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381857862] [2021-12-28 02:33:35,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:33:35,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:33:35,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:33:35,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:33:35,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:33:35,712 INFO L87 Difference]: Start difference. First operand 446 states and 628 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 02:33:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 02:33:36,253 INFO L93 Difference]: Finished difference Result 765 states and 1062 transitions. [2021-12-28 02:33:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 02:33:36,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-28 02:33:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 02:33:36,255 INFO L225 Difference]: With dead ends: 765 [2021-12-28 02:33:36,256 INFO L226 Difference]: Without dead ends: 492 [2021-12-28 02:33:36,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-28 02:33:36,257 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 290 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 02:33:36,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1554 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 02:33:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-12-28 02:33:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 461. [2021-12-28 02:33:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2021-12-28 02:33:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 643 transitions. [2021-12-28 02:33:36,273 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 643 transitions. Word has length 59 [2021-12-28 02:33:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 02:33:36,273 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 643 transitions. [2021-12-28 02:33:36,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 02:33:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 643 transitions. [2021-12-28 02:33:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 02:33:36,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 02:33:36,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:33:36,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 02:33:36,275 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 02:33:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:33:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1649128487, now seen corresponding path program 1 times [2021-12-28 02:33:36,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:33:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422940791] [2021-12-28 02:33:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:33:36,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:33:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 02:33:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 02:33:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 02:33:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 02:33:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 02:33:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 02:33:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 02:33:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:33:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:33:36,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:33:36,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422940791] [2021-12-28 02:33:36,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422940791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:33:36,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:33:36,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:33:36,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379865117] [2021-12-28 02:33:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:33:36,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:33:36,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:33:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:33:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:33:36,345 INFO L87 Difference]: Start difference. First operand 461 states and 643 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 02:33:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 02:33:36,911 INFO L93 Difference]: Finished difference Result 855 states and 1156 transitions. [2021-12-28 02:33:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:33:36,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-28 02:33:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 02:33:36,913 INFO L225 Difference]: With dead ends: 855 [2021-12-28 02:33:36,914 INFO L226 Difference]: Without dead ends: 569 [2021-12-28 02:33:36,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-28 02:33:36,915 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 714 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 02:33:36,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 1252 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 02:33:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-12-28 02:33:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 473. [2021-12-28 02:33:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2021-12-28 02:33:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 653 transitions. [2021-12-28 02:33:36,963 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 653 transitions. Word has length 59 [2021-12-28 02:33:36,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 02:33:36,964 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 653 transitions. [2021-12-28 02:33:36,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 02:33:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 653 transitions. [2021-12-28 02:33:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 02:33:36,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 02:33:36,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:33:36,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 02:33:36,965 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 02:33:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:33:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash 651694103, now seen corresponding path program 1 times [2021-12-28 02:33:36,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:33:36,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331187106] [2021-12-28 02:33:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:33:36,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:33:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:33:36,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 02:33:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:33:36,997 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 02:33:36,998 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 02:33:36,998 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-28 02:33:37,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-28 02:33:37,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 02:33:37,002 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-28 02:33:37,004 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 02:33:37,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:33:37 BoogieIcfgContainer [2021-12-28 02:33:37,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 02:33:37,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 02:33:37,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 02:33:37,061 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 02:33:37,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:33:32" (3/4) ... [2021-12-28 02:33:37,063 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 02:33:37,107 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 02:33:37,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 02:33:37,108 INFO L158 Benchmark]: Toolchain (without parser) took 5473.15ms. Allocated memory was 52.4MB in the beginning and 127.9MB in the end (delta: 75.5MB). Free memory was 29.0MB in the beginning and 74.2MB in the end (delta: -45.1MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2021-12-28 02:33:37,108 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 34.2MB in the beginning and 34.1MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:33:37,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.84ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 43.9MB in the end (delta: -15.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2021-12-28 02:33:37,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.87ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 40.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 02:33:37,109 INFO L158 Benchmark]: Boogie Preprocessor took 43.01ms. Allocated memory is still 67.1MB. Free memory was 40.8MB in the beginning and 38.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 02:33:37,109 INFO L158 Benchmark]: RCFGBuilder took 512.38ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 44.9MB in the end (delta: -6.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2021-12-28 02:33:37,109 INFO L158 Benchmark]: TraceAbstraction took 4418.80ms. Allocated memory was 67.1MB in the beginning and 127.9MB in the end (delta: 60.8MB). Free memory was 44.6MB in the beginning and 86.7MB in the end (delta: -42.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2021-12-28 02:33:37,110 INFO L158 Benchmark]: Witness Printer took 46.95ms. Allocated memory is still 127.9MB. Free memory was 86.7MB in the beginning and 74.2MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 02:33:37,111 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 34.2MB in the beginning and 34.1MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.84ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 43.9MB in the end (delta: -15.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.87ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 40.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.01ms. Allocated memory is still 67.1MB. Free memory was 40.8MB in the beginning and 38.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.38ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 44.9MB in the end (delta: -6.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4418.80ms. Allocated memory was 67.1MB in the beginning and 127.9MB in the end (delta: 60.8MB). Free memory was 44.6MB in the beginning and 86.7MB in the end (delta: -42.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 46.95ms. Allocated memory is still 127.9MB. Free memory was 86.7MB in the beginning and 74.2MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. 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 m_st ; [L505] int t1_st ; [L506] int t2_st ; [L507] int t3_st ; [L508] int m_i ; [L509] int t1_i ; [L510] int t2_i ; [L511] int t3_i ; [L512] int M_E = 2; [L513] int T1_E = 2; [L514] int T2_E = 2; [L515] int T3_E = 2; [L516] int E_M = 2; [L517] int E_1 = 2; [L518] int E_2 = 2; [L519] int E_3 = 2; [L525] int token ; [L527] 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_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, token=0] [L1212] COND TRUE __VERIFIER_nondet_int() [L1213] 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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, 259 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2862 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2811 mSDsluCounter, 6743 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4882 mSDsCounter, 624 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4234 IncrementalHoareTripleChecker+Invalid, 4858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 624 mSolverCounterUnsat, 1861 mSDtfsCounter, 4234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=5, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 271 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, 628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-28 02:33:37,136 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